scientific article; zbMATH DE number 1263840

MaRDI QIDQ4234763zbMATH OpenFDO

Authors Richard M. Mayr

Publication date 16 March 1999

zbMATH Keywords

decidabilitymodel checking problemsprocess rewrite systemsPRS-hierarchy

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of software (68N99) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Decidability of model checking for infinite-state concurrent systems
• Verification, Model Checking, and Abstract Interpretation
• Model checking for process rewrite systems and a class of action-based regular properties
• On Decidability of LTL Model Checking for Process Rewrite Systems
• On decidability of LTL model checking for process rewrite systems

Cited in

(24)

• On decidability of LTL model checking for process rewrite systems
• Verification in loosely synchronous queue-connected discrete timed automata.
• Process rewrite systems.
• Decidability of model checking for infinite-state concurrent systems
• Incompleteness of states w.r.t. traces in model checking
• Model checking for process rewrite systems and a class of action-based regular properties
• scientific article; zbMATH DE number 1670767 (Why is no real title available?)
• Honesty by typing
• Normalization of linear Horn clauses
• Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
• Infinite State Model-Checking of Propositional Dynamic Logics
• A decidability result for the model checking of infinite-state systems
• scientific article; zbMATH DE number 1456956 (Why is no real title available?)
• Normed processes, unique decomposition, and complexity of bisimulation equivalences
• Bounded communication reachability analysis of process rewrite systems with ordered parallelism
• On Decidability of LTL+Past Model Checking for Process Rewrite Systems
• Model Checking Synchronized Products of Infinite Transition Systems
• scientific article; zbMATH DE number 2217747 (Why is no real title available?)
• Decidable models of integer-manipulating programs with recursive parallelism
• Decidability of model checking with the temporal logic EF
• Deciding bisimulation-like equivalences with finite-state processes
• Constrained properties, semilinear systems, and Petri nets
• On the complexity of the linear-time μ-calculus for Petri Nets
• Verification of well-formed communicating recursive state machines

Describes a project that uses

Uses Software

• PVS

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 Q4234763)