Analysis issues in Petri nets with inhibitor arcs

Theoretical Computer Science

Volumn 275, Issue 1-2, 2002, Pages 127-177

  Busi, Nadia ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DIFFERENTIATION (CALCULUS); ENCODING (SYMBOLS); PETRI NETS;

INHIBITOR ARCS;

COMPUTER SCIENCE;

EID: 0037187398     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00127-X     Document Type: Article

References (24)

1. A complete model for representing the coordination of asynchronous processes
2. A Petri net semantics for π-calculus
3. On the expressiveness of Linda coordination primitives
4. Process semantics for place/transition nets with inhibitor and read arcs
5. Complexity results for 1-safe nets
6. Free choice Petri nets
7. Decidability of model checking for infinite-state concurrent systems
8. Comments on capabilities, limitations and 'correctness' of Petri nets
9. The recursive equivalence of the reachability problem and the liveness problem for Petri nets and Vector addition systems
10. Parallel program schemata
11. Decidability of reachability in vector addition systems
12. Semantics of inhibitor nets
13. An algorithm for the general Petri net reachability problem
14. A calculus of mobile processes
15. Contextual nets
16. Computability of recursive functions
17. Partial order semantics and read arcs