Constrained properties, semilinear systems, and Petri nets

DOI10.1007/3-540-61604-7_71zbMath1514.68125OpenAlexW1489794625MaRDI QIDQ6162100

Peter Habermehl, Ahmed Bouajjani

Publication date: 28 June 2023

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

Full work available at URL: https://doi.org/10.1007/3-540-61604-7_71

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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)

Related Items (11)

Model-checking structured context-free languages ⋮ Precise interprocedural dependence analysis of parallel programs ⋮ Model Checking Procedural Programs ⋮ On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ Model checking PA-processes ⋮ Verification of well-formed communicating recursive state machines ⋮ On Decidability of LTL+Past Model Checking for Process Rewrite Systems ⋮ Decidability of model checking with the temporal logic EF ⋮ Model checking for process rewrite systems and a class of action-based regular properties ⋮ Unnamed Item ⋮ Process rewrite systems.

Cites Work

• The residue of vector sets with applications to decidability problems in Petri nets
• A taxonomy of fairness and temporal logic problems for Petri nets
• Decidability of a temporal logic problem for Petri nets
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Bisimulation equivalence is decidable for all context-free processes
• An Algorithm for the General Petri Net Reachability Problem
• Star-free regular sets of ω-sequences
• Unnamed Item
• Unnamed Item

This page was built for publication: Constrained properties, semilinear systems, and Petri nets