Specification and verification of asynchronous circuits using marked graphs
Concurrency and nets: advances in Petri nets
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
ACM Computing Surveys (CSUR)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Analysis of Distributed Algorithms based on Recurrence Relations (Preliminary Version)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Behavioral Equivalence of Concurrent Systems
Selected Papers from the 3rd European Workshop on Applications and Theory of Petri Nets
Concurrency, Synchronization, and Conflicts in Petri Nets
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
| Hi-index | 0.00 |
Petri nets and their languages are a useful model of systems exhibiting concurrentbehavior. The sequential language associated with a given Petri net S consists of allpossible firing sequences of S, where each element of a firing sequence is a singletransition. The concurrent language associated with S consists of all possible concurrentfiring sequences of S, where each element of a concurrent firing sequence is a set oftransitions. The sequential language and the concurrent language associated with S aredenoted by (L)(S) and (/spl pi/)(S), respectively. In this paper, we consider an importantspecial ease of Petri nets, called labeled marked graphs. The main result derived in thispaper states that if /spl Gammasub 1/ and /spl Gammasub 2/ are two structurallydeterministic labeled marked graphs, then (L)(/spl Gammasub 1/)=L(/spl Gammasub 2/)/spl rlhar2spl pi/(/spl Gammasub 1/)=/spl pi/(/spl Gammasub 2/).