Sciweavers

100 search results - page 10 / 20
» On the Semantics of Place Transition Nets
Sort
View
APN
2006
Springer
14 years 5 days ago
Nested Nets for Adaptive Systems
We consider nested nets, i.e. Petri nets in which tokens can be Petri nets themselves. We study value semantics of nested nets rather than reference semantics, and apply nested ne...
Kees M. van Hee, Irina A. Lomazova, Olivia Oanea, ...
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 8 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
CSL
2007
Springer
14 years 10 days 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...
FUIN
2007
108views more  FUIN 2007»
13 years 8 months ago
An Axiomatization of the Token Game Based on Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 3 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert