Concurrent systems and inevitability
A concurrent system is a poset \(S=(S,\leq)\), where S is the set of states of the system (histories of its activity) and \(\leq\) is the dominating relation between states. A process is any maximal directed subposet of S, the family of all processes in S is called the behaviour of S. Processes correspond to full executions, namely they display concurrency fairness. In order to speak of eventual properties of processes the authors define the concept of observation of processes. If P \(\subseteq\) S is a process, a line (i.e. a maximal linearly ordered subposet of S) V is an observation if \(\downarrow V=P\) with \(\downarrow V=\cup (\downarrow \sigma |\) \(\sigma\in V)\), where \(\downarrow \sigma =\{\tau \in S|\) \(\tau\leq \sigma \}\). This is a case for processes in terminating and strongly synchronized systems, which, therefore, are observable. In this framework, the authors introduce the notion of inevitability. A property is inevitable if an observer of the system will notice, soon or later, a state with this property. The authors discuss conditions on processes and observers and their relationship with inevitability. One of these conditions characterizes inevitability in the interesting case of diamond discrete systems.
- Behaviours of concurrent systems
- Defining liveness
- Fairness and conspiracies
- 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?)
- 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
- Inevitability in concurrent systems
- Petri net semantics of priority systems
- On undecidability of propositional temporal logics on trace systems
- Proving partial order properties
- Petri nets, traces, and local model checking
- Model checking properties on reduced trace systems
- Progress assumption in concurrent systems
- Ensuring liveness properties of distributed systems: open problems
- A study on team bisimulation and H-team bisimulation for BPP nets
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- Inevitability in diamond processes
- scientific article; zbMATH DE number 3915634 (Why is no real title available?)
- scientific article; zbMATH DE number 23767 (Why is no real title available?)
- Petri nets, traces, and local model checking
- Modelling concurrency with semi-commutations
- Programming Languages and Systems
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
- Trace consistency and inevitability
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)