Concurrent Systems and Inevitability

  title={Concurrent Systems and Inevitability},
  author={Antoni W. Mazurkiewicz and Edward Ochmanski and Wojciech Penczek},
  journal={Theor. Comput. Sci.},
True versus artificial concurrency
Some theoretical issues related to concurrent processed are discussed: formal description of concurrent systems, concurrent systems synchronization, refinement of systems, fairness assumption. These
Extending Temporal Logic by Explicit Concurrency
The logic has the finite model property and a sound and complete axiomatization and is the first formalism to combine negation with structural operators for sequential and parallel composition.
Model Checking Properties on Reduced Trace Systems
This paper interpret a temporal logic over a partial order model that is a trace system that can be completely avoided and a method is presented that keeps the trace system finite, also in the presence of infinite computations.
A Concurrent Branching Time Temporal Logic
This paper shows that a computation tree logic (CTL) can be very naturally extended to distinguish concurrency from non — determinism by using a frame of the form (S,R), and proves that CCTL is finitely axiomatizable, decidable and it has the finite model property.
Defining Process Fairness for Non-Interleaving Concurrency
The model has been extended with additional structure so that process fairness can be defined, and a variety of decompositions of the system into concurrent sub-processes, partially ordered by a refinement relation, have been derived.
Trace Consistency and Inevitablity
It is shown that determining whether a formula is inevitable is undecidable, however, for a subclass of formulas termed coherent (propositions in them can be affected by either of a pair of independent operations but not both), inevitability becomes decidable.
Modelling Reactive Hardware Processes Using Partial Orders
This work presents an approach based on partial-order semantics for abstract specification and composition of reactive hardware processes, and proves the correctness of networks of such processes, by using behavior machines as finite presentations of pomtrees.
Proving Partial Order Properties
Modelling Concurrency with Semi-Commutations
Ordered semi-commutative monoids are chosen for this purpose; their directed subsets represent processes of concurrent systems and the main one is the diamond property.


Inevitability in Concurrent Systems
Verification of Concurrent Programs: Temporal Proof Principles
This paper presents proof methods for establishing invariance (safety) and eventuality (liveness) properties of temporal logic in concurrent programs.
Behaviours of Concurrent Systems
  • J. Winkowski
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1980
Defining Liveness
Proving Liveness Properties of Concurrent Programs
A formal proof method, based on temporal logic, for deriving liveness properties is presented, which allows a rigorous formulation of simple informal arguments and how to reason with temporal logic and use safety (invariance) properties in proving liveness is shown.
Petri Nets, Event Structures and Domains
The general aim of the paper is to find a theory of concurrency combining the approaches of Petri and Scott, and to connect the abstract ideas of events and domains of information, by showing how causal nets induce certain kinds of domains where the information points are certain sets of events.
Fairness and Conspiracies
  • E. Best
  • Computer Science
    Inf. Process. Lett.
  • 1984