scientific article; zbMATH DE number 1456956
From MaRDI portal
Publication:4954445
zbMATH Open0938.03537MaRDI QIDQ4954445FDOQ4954445
Publication date: 7 June 2000
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (20)
- Title not available (Why is that?)
- Deciding properties of integral relational automata
- Constrained properties, semilinear systems, and Petri nets
- On the complexity of resource-bounded logics
- Title not available (Why is that?)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems
- Nominal Automata for Resource Usage Control
- Reasoning about reversal-bounded counter machines
- Model checking the full modal mu-calculus for infinite sequential processes
- On decidability of LTL model checking for process rewrite systems
- 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
- Decidability of model checking for infinite-state concurrent systems
- Title not available (Why is that?)
- 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
- Honesty by Typing
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
- Title not available (Why is that?)
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)
