Failures semantics based on interval semiwords is a congruence for refinement

DOI10.1007/BF01798961zbMath0723.68069MaRDI QIDQ757073

Walter Vogler

Publication date: 1991

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

Petri netspartial order semanticsdivergenceinterval ordersaction refinementfailures semantics

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (15)

Concurrent testing of processes ⋮ Deciding true concurrency equivalences on safe, finite nets ⋮ Languages of higher-dimensional automata ⋮ The difference between splitting in \(n\) and \(n+1\) ⋮ Axiomatizing shuffle and concatenation in languages ⋮ Timing and causality in process algebra ⋮ Generating Posets Beyond N ⋮ Unnamed Item ⋮ Deciding true concurrency equivalences on finite safe nets (preliminary report) ⋮ Bisimulation and action refinement ⋮ Unnamed Item ⋮ Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice ⋮ Vertical implementation ⋮ The box algebra = Petri nets + process expressions ⋮ Finite Petri nets as models for recursive causal behaviour

Cites Work

• A method for stepwise refinement and abstraction of Petri nets
• Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
• Modeling concurrency with partial orders
• Failures semantics and deadlocking of modular Petri nets
• Sequential and concurrent behaviour in Petri net theory
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Analysis of Petri nets by stepwise refinements
• Intransitive indifference with unequal indifference intervals
• Concurrent bisimulations in Petri nets
• The non-sequential behaviour of Petri nets
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Failures semantics based on interval semiwords is a congruence for refinement