Concurrent systems and inevitability

DOI10.1016/0304-3975(89)90052-2zbMath0675.68015OpenAlexW2044054723MaRDI QIDQ1122355

Edward Ochmański, Wojciech Penczek, Antoni Mazurkiewicz

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90052-2

zbMATH Keywords

observerspartial order semanticsconcurrent processesinevitability

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theory of operating systems (68N25)

Related Items (12)

Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Inevitability in diamond processes ⋮ Modelling concurrency with semi-commutations ⋮ Petri nets, traces, and local model checking ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ Model checking properties on reduced trace systems ⋮ Petri net semantics of priority systems ⋮ On undecidability of propositional temporal logics on trace systems ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ Petri nets, traces, and local model checking ⋮ Proving partial order properties

Cites Work

• Fairness and conspiracies
• Defining liveness
• Inevitability in concurrent systems
• The temporal semantics of concurrent programs
• Behaviours of concurrent systems
• Petri nets, event structures and domains. I
• The non-sequential behaviour of Petri nets
• Proving Liveness Properties of Concurrent Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concurrent systems and inevitability