58 search results - page 7 / 12 » A Class of Petri Nets with a Convex Reachability Set |
CONCUR
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
ACSD
2006
IEEE
15 years 3 months ago
2006
IEEE
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
CONCUR
2000
Springer
15 years 1 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...