Abstract is missing.
- Time elastic digital systems and Petri NetsMichael Kishinevsky, Jordi Cortadella. 1-2 [doi]
- Avoiding irreducible CSC conflicts by internal communicationMark Schäfer, Walter Vogler, Dominic Wist, Ralf Wollowski. 3-12 [doi]
- Using edge-triggering in the asynchronous synthesis of write-after-read operationsNavid Toosizadeh, Safwat G. Zaky. 13-20 [doi]
- A design method for 1-out-of-4 encoded low-power self-timed circuits using standard cell librariesMasashi Imai, Takashi Nanya. 21-26 [doi]
- Dynamic Critical-Path based on Fit Degree scheduling for reconfigurable multi-FPGAsYan Xiao, Zhenhua Duan. 27-32 [doi]
- PicNIc - Pi-calculus non-interference checkerSilvia Crafa, Matteo Mio, Marino Miculan, Carla Piazza, Sabina Rossi. 33-38 [doi]
- Closed loop state space analysis and simulation for Cognitive SystemsHendrik Oberheid, Dennis Gamrad, Dirk Söffker. 39-44 [doi]
- BAM: BioAmbient machineVinod A. Muganthan, Andrew Phillips, Maria Grazia Vigliotti. 45-49 [doi]
- A behavioral synthesis method for asynchronous circuits with bundled-data implementation (Tool paper)Naohiro Hamada, Yuuki Shiga, Hiroshi Saito, Tomohiro Yoneda, Chris J. Myers, Takashi Nanya. 50-55 [doi]
- An effective approach for model checking SystemC designsRazieh Behjati, Hamideh Sabouri, Niloofar Razavi, Marjan Sirjani. 56-61 [doi]
- Process algebraic verification of SystemC codesHossein Hojjat, Mohammad Reza Mousavi, Marjan Sirjani. 62-67 [doi]
- Modular construction of finite and complete prefixes of Petri net unfoldingsAgnes Madalinski, Eric Fabre. 68-77 [doi]
- Performing causality analysis by bounded model checkingKlaus Schneider, Jens Brandt. 78-87 [doi]
- Modular construction of the symbolic observation graphKais Klai, Laure Petrucci. 88-97 [doi]
- Time-bounded model checking of infinite-state continuous-time Markov chainsLijun Zhang, Holger Hermanns, Ernst Moritz Hahn, Björn Wachter. 98-107 [doi]
- Symbolic model checking of hierarchical UML state machinesJori Dubrovin, Tommi A. Junttila. 108-117 [doi]
- Asynchronous pipeline controller based on early acknowledgement protocolChammika Mannakkara, Tomohiro Yoneda. 118-127 [doi]
- Verification of conditional partial order graphsAndrey Mokhov, Alexandre Yakovlev. 128-137 [doi]
- Modeling and verifying asynchronous communication mechanisms using coloured Petri netsKyller Costa Gorgônio, Fei Xia. 138-147 [doi]
- A method for latency/bandwidth guarantees in Network-on-ChipShijun Lin, Li Su, Haibo Su, Guofei Zhou, Depeng Jin, Lieguang Zeng. 148-153 [doi]
- Removing causality cycle of synchronous programs with sequential data-flow recursionTieqiang Mo, Peng Hao. 154-159 [doi]
- QoS-driven service selection and compositionSun Meng, Farhad Arbab. 160-169 [doi]
- Synthesis of Petri nets from infinite partial languagesRobin Bergenthum, Jörg Desel, Robert Lorenz, Sebastian Mauser. 170-179 [doi]
- Discrete real-time and stochastic-time process algebra for performance analysis of distributed systemsJasen Markovski, Erik P. de Vink. 180-189 [doi]
- On the interplay between fault handling and request-response service invocationsClaudio Guidi, Ivan Lanese, Fabrizio Montesi, Gianluigi Zavattaro. 190-198 [doi]
- An admission control system for QoS provision on a best-effort GALS interconnectShufan Yang, Steve Furber, Yebin Shi, Luis A. Plana. 200-207 [doi]
- Dynamic semantics of OWL-S in CSP-OZPing Gong, Keqing He, Jian Wang, Zaiwen Feng. 208-213 [doi]