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