Sciweavers

1014 search results - page 158 / 203
» ''What Is a Petri Net
Sort
View
ATVA
2006
Springer
100views Hardware» more  ATVA 2006»
14 years 2 months ago
A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
Ming-Ying Chung, Gianfranco Ciardo, Andy Jinqing Y...
COORDINATION
2006
Springer
14 years 2 months ago
Formalising Business Process Execution with Bigraphs and Reactive XML
Bigraphical Reactive Systems have been proposed as a meta model for global ubiquitous computing generalising process calculi for mobility such as the pi-calculus and the Mobile Amb...
Thomas T. Hildebrandt, Henning Niss, Martin Olsen
DSD
2006
IEEE
99views Hardware» more  DSD 2006»
14 years 2 months ago
Flexible Bus and NoC Performance Analysis with Configurable Synthetic Workloads
We present a flexible method for bus and network on chip performance analysis, which is based on the adaptation of workload models to resemble various applications. Our analysis m...
Rikard Thid, Ingo Sander, Axel Jantsch
FOSSACS
2006
Springer
14 years 2 months ago
Processes for Adhesive Rewriting Systems
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
FSTTCS
2006
Springer
14 years 2 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...