Sciweavers

191 search results - page 17 / 39
» Transition systems, link graphs and Petri nets
Sort
View
ESM
2000
14 years 11 months ago
Zero-overhead Pr/T-Net execution
Petri Nets and higher order versions like Predicate Transition Nets (Pr/T-Nets) are very suitable for modeling event-oriented discrete and even parallel systems. Obviously, the ne...
Carsten Böke, Markus Hübel, Franz J. Ram...
SOFSEM
2010
Springer
14 years 7 months ago
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
Parosh Aziz Abdulla
APN
2003
Springer
15 years 2 months ago
On Reachability in Autonomous Continuous Petri Net Systems
Fluidification is a common relaxation technique used to deal in a more friendly way with large discrete event dynamic systems. In Petri nets, fluidification leads to continuous ...
Jorge Júlvez, Laura Recalde, Manuel Silva
APN
2007
Springer
15 years 3 months ago
Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms
In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distrib...
Marco Beccuti, Giuliana Franceschinis, Serge Hadda...
CSL
2007
Springer
15 years 1 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...