scientific article; zbMATH DE number 827979
From MaRDI portal
Publication:4858945
zbMath0838.68082MaRDI QIDQ4858945
Javier Esparza, Mogens Nielsen
Publication date: 20 December 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Computation in networks of passively mobile finite-state sensors ⋮ Petri nets, commutative context-free grammars, and basic parallel processes ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ Petri nets for modelling metabolic pathways: a survey ⋮ Liveness in broadcast networks ⋮ Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy ⋮ The polynomial complexity of vector addition systems with states ⋮ Small vertex cover makes Petri net coverability and boundedness easier ⋮ Properties of enhanced mobile membranes via coloured Petri nets ⋮ Finding cut-offs in leaderless rendez-vous protocols is easy ⋮ Verification of well-formed communicating recursive state machines ⋮ A new type system for JVM lock primitives ⋮ Synthesis and Analysis of Product-Form Petri Nets ⋮ A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application ⋮ Soundness of workflow nets: classification, decidability, and analysis ⋮ Unnamed Item ⋮ Nonprimitive recursive complexity and undecidability for Petri net equivalences ⋮ Inheritance of behavior ⋮ A type system for lock-free processes ⋮ A general approach to comparing infinite-state systems with their finite-state specifications ⋮ Inheritance of workflows: An approach to tackling problems related to change ⋮ State space analysis of Petri nets with relation-algebraic methods ⋮ Unnamed Item ⋮ Reachability Problems for Continuous Chemical Reaction Networks ⋮ Analyzing Reachability for Some Petri Nets With Fast Growing Markings ⋮ Acyclic and Cyclic Reversing Computations in Petri Nets ⋮ Program schemes, arrays, Lindström quantifiers and zero-one laws
