default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th ACSD 2008: Xi'an, China
- Jonathan Billington, Zhenhua Duan, Maciej Koutny:
8th International Conference on Application of Concurrency to System Design (ACSD 2008), Xi'an, China, June 23-27, 2008. IEEE 2008, ISBN 978-1-4244-1838-1 - Michael Kishinevsky, Jordi Cortadella
:
Time elastic digital systems and Petri Nets. 1-2 - Mark Schäfer, Walter Vogler, Dominic Wist, Ralf Wollowski:
Avoiding irreducible CSC conflicts by internal communication. 3-12 - Navid Toosizadeh, Safwat G. Zaky:
Using edge-triggering in the asynchronous synthesis of write-after-read operations. 13-20 - Masashi Imai, Takashi Nanya:
A design method for 1-out-of-4 encoded low-power self-timed circuits using standard cell libraries. 21-26 - Yan Xiao, Zhenhua Duan:
Dynamic Critical-Path based on Fit Degree scheduling for reconfigurable multi-FPGAs. 27-32 - Silvia Crafa, Matteo Mio, Marino Miculan, Carla Piazza, Sabina Rossi:
PicNIc - Pi-calculus non-interference checker. 33-38 - Hendrik Oberheid, Dennis Gamrad, Dirk Söffker:
Closed loop state space analysis and simulation for Cognitive Systems. 39-44 - Vinod A. Muganthan, Andrew Phillips, Maria Grazia Vigliotti:
BAM: BioAmbient machine. 45-49 - Naohiro Hamada, Yuki Shiga, Hiroshi Saito, Tomohiro Yoneda, Chris J. Myers, Takashi Nanya:
A behavioral synthesis method for asynchronous circuits with bundled-data implementation (Tool paper). 50-55 - Razieh Behjati, Hamideh Sabouri, Niloofar Razavi, Marjan Sirjani:
An effective approach for model checking SystemC designs. 56-61 - Hossein Hojjat, Mohammad Reza Mousavi, Marjan Sirjani:
Process algebraic verification of SystemC codes. 62-67 - Agnes Madalinski, Eric Fabre:
Modular construction of finite and complete prefixes of Petri net unfoldings. 68-77 - Klaus Schneider, Jens Brandt:
Performing causality analysis by bounded model checking. 78-87 - Kais Klai, Laure Petrucci:
Modular construction of the symbolic observation graph. 88-97 - Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, Björn Wachter:
Time-bounded model checking of infinite-state continuous-time Markov chains. 98-107 - Jori Dubrovin, Tommi A. Junttila:
Symbolic model checking of hierarchical UML state machines. 108-117 - Chammika Mannakkara, Tomohiro Yoneda:
Asynchronous pipeline controller based on early acknowledgement protocol. 118-127 - Andrey Mokhov, Alexandre Yakovlev:
Verification of conditional partial order graphs. 128-137 - Kyller Costa Gorgônio, Fei Xia:
Modeling and verifying asynchronous communication mechanisms using coloured Petri nets. 138-147 - Shijun Lin, Li Su, Haibo Su, Guofei Zhou, Depeng Jin, Lieguang Zeng:
A method for latency/bandwidth guarantees in Network-on-Chip. 148-153 - Tieqiang Mo, Peng Hao:
Removing causality cycle of synchronous programs with sequential data-flow recursion. 154-159 - Sun Meng, Farhad Arbab:
QoS-driven service selection and composition. 160-169 - Robin Bergenthum, Jörg Desel, Robert Lorenz, Sebastian Mauser:
Synthesis of Petri nets from infinite partial languages. 170-179 - Jasen Markovski, Erik P. de Vink:
Discrete real-time and stochastic-time process algebra for performance analysis of distributed systems. 180-189 - Claudio Guidi, Ivan Lanese, Fabrizio Montesi, Gianluigi Zavattaro:
On the interplay between fault handling and request-response service invocations. 190-198 - Shufan Yang, Steve B. Furber, Yebin Shi, Luis A. Plana:
An admission control system for QoS provision on a best-effort GALS interconnect. 200-207 - Ping Gong, Keqing He, Jian Wang, Zaiwen Feng:
Dynamic semantics of OWL-S in CSP-OZ. 208-213
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-30 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
