Petri nets, traces, and local model checking

DOI10.1007/3-540-60043-4_62zbMath1496.68221OpenAlexW4237324797MaRDI QIDQ5096394

Allan Cheng

Publication date: 16 August 2022

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60043-4_62

zbMATH Keywords

inevitabilitypartial orderslocal model checkingfair progresslabelled 1-safe netsmaximal traces

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Event fairness and non-interleaving concurrency
• Concurrent transition systems
• Concurrent systems and inevitability
• Local model checking in the modal mu-calculus
• A logical study of distributed transition systems
• Bisimulation from open maps
• Concurrent Machines
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION
• Deciding true concurrency equivalences on finite safe nets (preliminary report)

This page was built for publication: Petri nets, traces, and local model checking