A theory of structural stationarity in the \(\pi\)-calculus

DOI10.1007/s00236-009-0091-xzbMath1165.68053OpenAlexW2091676842MaRDI QIDQ1014276

Roland Meyer

Publication date: 27 April 2009

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-009-0091-x

zbMATH Keywords

Petri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

A counter abstraction technique for verifying properties of probabilistic swarm systems, On the Relationship between π-Calculus and Finite Place/Transition Petri Nets, Deciding safety properties in infinite-state pi-calculus via behavioural types, Multiset rewriting for the verification of depth-bounded processes with name binding, Unnamed Item, Well-structured graph transformation systems, On Hierarchical Communication Topologies in the $$\pi $$ -calculus, Parameterized verification of monotone information systems, Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS, Petruchio

Uses Software

• MWB
• SLMC

Cites Work

• Undecidability of bisimilarity for Petri nets and some related problems
• A multiset semantics for the pi-calculus with replication
• An exercise in structural congruence
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
• Multisets and structural congruence of the pi-calculus with replication
• An improvement of McMillan's unfolding algorithm
• Analysis issues in Petri nets with inhibitor arcs
• Model checking mobile processes
• Static analysis for the \(\pi\)-calculus with applications to security
• A spatial logic for concurrency. I
• Canonical prefixes of Petri net unfoldings
• A new natural structural congruence in the pi-calculus with replication
• Decidability of model checking for infinite-state concurrent systems
• A Petri Net Translation of π-Calculus Terms
• Nets, Terms and Formulas
• Foundations of Software Science and Computation Structures
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item