Model checking PA-processes

DOI10.1007/3-540-63141-0_23zbMath1517.68247OpenAlexW1492575876MaRDI QIDQ6044127

Richard Mayr

Publication date: 17 May 2023

Published in: CONCUR '97: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63141-0_23

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)

Related Items (5)

Tableau methods for PA-processes ⋮ Decidability of model checking with the temporal logic EF ⋮ Deciding bisimulation-like equivalences with finite-state processes ⋮ The regular viewpoint on PA-processes ⋮ Process rewrite systems.

Cites Work

• Unnamed Item
• Decidability of model checking for infinite-state concurrent systems
• Constrained properties, semilinear systems, and Petri nets

This page was built for publication: Model checking PA-processes