Concurrent systems and inevitability
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3825182 (Why is no real title available?)
- scientific article; zbMATH DE number 3896328 (Why is no real title available?)
- scientific article; zbMATH DE number 3924146 (Why is no real title available?)
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- scientific article; zbMATH DE number 4037221 (Why is no real title available?)
- scientific article; zbMATH DE number 3735115 (Why is no real title available?)
- scientific article; zbMATH DE number 3755842 (Why is no real title available?)
- scientific article; zbMATH DE number 3264065 (Why is no real title available?)
- Behaviours of concurrent systems
- Defining liveness
- Fairness and conspiracies
- Inevitability in concurrent systems
- Petri nets, event structures and domains. I
- Proving Liveness Properties of Concurrent Programs
- The non-sequential behaviour of Petri nets
- The temporal semantics of concurrent programs
Cited in
(19)- Programming Languages and Systems
- Petri nets, traces, and local model checking
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
- Trace consistency and inevitability
- Inevitability in concurrent systems
- Progress assumption in concurrent systems
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- Inevitability in diamond processes
- Petri nets, traces, and local model checking
- Petri net semantics of priority systems
- On undecidability of propositional temporal logics on trace systems
- Proving partial order properties
- scientific article; zbMATH DE number 23767 (Why is no real title available?)
- A study on team bisimulation and H-team bisimulation for BPP nets
- Modelling concurrency with semi-commutations
- scientific article; zbMATH DE number 3915634 (Why is no real title available?)
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Ensuring liveness properties of distributed systems: open problems
- Model checking properties on reduced trace systems
This page was built for publication: Concurrent systems and inevitability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122355)