Petri nets, traces, and local model checking

DOI10.1016/S0304-3975(96)00326-XzbMath0901.68141MaRDI QIDQ1391100

Allan Cheng

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

model-checkinginevitabilitypartial ordersfair progresslabelled 1-safe netsmaximal traces

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Petri nets, traces, and local model checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity results for 1-safe nets
• Event fairness and non-interleaving concurrency
• Concurrent transition systems
• Concurrent systems and inevitability
• Petri nets, event structures and domains. I
• Local model checking in the modal mu-calculus
• Symbolic model checking: \(10^{20}\) states and beyond
• A partial approach to model checking
• Petri nets, traces, and local model checking
• A logical study of distributed transition systems
• Concurrent Machines
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Graph-Based Algorithms for Boolean Function Manipulation
• Nets, Terms and Formulas
• TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION
• Deciding true concurrency equivalences on finite safe nets (preliminary report)