Model checking reversible systems: forwardly

DOI10.1007/978-3-031-62076-8_14MaRDI QIDQ6637601

G. Michele Pinna, Federico Dal Pio Luogo, Claudio Antares Mezzina

Publication date: 13 November 2024

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reversibility in the higher-order \(\pi\)-calculus
• Branching processes of Petri nets
• Reversing steps in membrane systems computations
• Checkpoint/rollback vs causally-consistent reversibility
• Canonical prefixes of Petri net unfoldings
• Unfoldings: A partial-order approach to model checking.
• Trellis processes: a compact representation for runs of concurrent systems
• Reversing algebraic process calculi
• Reversible computation in nets with bonds
• A hierarchy of reverse bisimulations on stable configuration structures
• Model-Checking Linear-Time Properties of Quantum Systems
• The non-sequential behaviour of Petri nets
• A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
• Forward-Reverse Observational Equivalences in CCSK
• CONCUR 2004 - Concurrency Theory
• Concurrent Flexible Reversibility
• Event Identifier Logic
• CONCUR 2005 – Concurrency Theory
• Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker
• Relating reversible Petri nets and reversible event structures, categorically

This page was built for publication: Model checking reversible systems: forwardly