scientific article; zbMATH DE number 559221
From MaRDI portal
Publication:4289279
zbMath0791.68123MaRDI QIDQ4289279
Mogens Nielsen, Javier Esparza
Publication date: 28 July 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petri netsdecidabilitybehavioural equivalencesconcurrent programmingtemporal logicsvector addition systemsparallel program schematamodel for parallel computationmodel checking problem
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (47)
Liveness of Parameterized Timed Networks ⋮ Guiding Craig interpolation with domain-specific abstractions ⋮ Causal message sequence charts ⋮ Fault diagnosis in discrete event systems modeled by partially observed Petri nets ⋮ When to Move to Transfer Nets ⋮ On reachability equivalence for BPP-nets ⋮ Linear time analysis of properties of conflict-free and general Petri nets ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ The reachability problem for branching vector addition systems requires doubly-exponential space ⋮ Reversing Unbounded Petri Nets ⋮ Unnamed Item ⋮ Towards a taxonomy for reversible computation approaches ⋮ Continuous Petri Nets: Expressive Power and Decidability Issues ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets ⋮ Bounded memory Dolev-Yao adversaries in collaborative systems ⋮ Termination Problems in Chemical Kinetics ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ Catalytic and communicating Petri nets are Turing complete ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Long-Run Average Behavior of Vector Addition Systems with States ⋮ Verification of membrane systems with delays via Petri nets with delays ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Recursive Petri nets ⋮ Complexity results for 1-safe nets ⋮ Behaviour, Interaction and Dynamics ⋮ Cut Elimination for Shallow Modal Logics ⋮ Decidability and complexity of Petri nets with unordered data ⋮ Decidability of Resilience for Well-Structured Graph Transformation Systems ⋮ Petri nets with name creation for transient secure association ⋮ Automated polyhedral abstraction proving ⋮ Decidability results in automata and process theory ⋮ On the Expressive Power of Restriction and Priorities in CCS with Replication ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Ackermannian completion of separators ⋮ Unnamed Item ⋮ Qualitative Analysis of VASS-Induced MDPs ⋮ Vector Addition System Reversible Reachability Problem ⋮ Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication ⋮ Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States ⋮ On Yen’s Path Logic for Petri Nets ⋮ Modelling Retrial-Upon-Conflict Systems with Product-Form Stochastic Petri Nets ⋮ Bounded memory protocols ⋮ Investigating Reversibility of Steps in Petri Nets ⋮ Flat Petri nets (invited talk) ⋮ Characterization and complexity results on jumping finite automata
This page was built for publication:
