scientific article; zbMATH DE number 1456956

MaRDI QIDQ4954445zbMATH OpenFDO

Authors Javier Esparza

Publication date 7 June 2000

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2217747
• Decidability of model checking for infinite-state concurrent systems
• On the complexity of the linear-time μ-calculus for Petri Nets
• On model checking for the -calculus and its fragments
• scientific article; zbMATH DE number 1263840

Cited in

(24)

• Deciding properties of integral relational automata
• Constrained properties, semilinear systems, and Petri nets
• On the complexity of resource-bounded logics
• scientific article; zbMATH DE number 2217747 (Why is no real title available?)
• Petri net reachability graphs: decidability status of FO properties
• On Decidability of LTL+Past Model Checking for Process Rewrite Systems
• Reasoning about reversal-bounded counter machines
• Model checking the full modal mu-calculus for infinite sequential processes
• Petri net reachability graphs: decidability status of first order properties
• On decidability of LTL model checking for process rewrite systems
• Forward analysis for WSTS. III: Karp-Miller trees
• Forward analysis for WSTS. III: Karp-Miller trees
• Decidability and undecidability results on the modal -calculus with a natural number-valued semantics
• Model checking Petri nets with names using data-centric dynamic systems
• On Yen’s Path Logic for Petri Nets
• Decidability of model checking with the temporal logic EF
• On the complexity of multi-pushdown games
• Decidability of model checking for infinite-state concurrent systems
• scientific article; zbMATH DE number 2186291 (Why is no real title available?)
• Honesty by typing
• Model checking for process rewrite systems and a class of action-based regular properties
• On the complexity of the linear-time μ-calculus for Petri Nets
• Nominal automata for resource usage control
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954445)