scientific article

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

concurrent systems bibliography Petri net traces dependency relation introductory overview event occurrence partially commutative manoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (88)

Weak equivalence of higher-dimensional automata ⋮ Topological abstraction of higher-dimensional automata ⋮ Concurrency-Preserving Minimal Process Representation ⋮ Extending propositional dynamic logic for Petri nets ⋮ Asynchronous automata versus asynchronous cellular automata ⋮ Stateless model checking under a reads-value-from equivalence ⋮ Undecidability of partial order logics ⋮ A partial trace semantics for Petri nets ⋮ Concurrent abstract state machines ⋮ Some complexity results on transition systems and elementary net systems ⋮ Partial-Order Reduction ⋮ Efficient rewriting in cograph trace monoids ⋮ Computing Petri net languages by reductions ⋮ On the synchronization of semi-traces ⋮ On the complementation of asynchronous cellular Büchi automata ⋮ Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) ⋮ A calculus and logic of resources and processes ⋮ Interpreting message flow graphs ⋮ Classifying Recognizable Infinitary Trace Languages Using Word Automata ⋮ An extended framework for passive asynchronous testing ⋮ Distributed synthesis of asynchronously communicating distributed process models ⋮ Computing race variants in message-passing concurrent programming with selective receives ⋮ Concurrent systems and inevitability ⋮ Classifying recognizable infinitary trace languages using word automata ⋮ The true concurrency of differential interaction nets ⋮ Polynomials, fragments of temporal logic and the variety DA over traces ⋮ Compositional relational semantics for indeterminate dataflow networks ⋮ Poset properties of complex traces ⋮ A fully abstract semantics for termination in Petri nets ⋮ On projective and separable properties ⋮ Petri nets, traces, and local model checking ⋮ Stateless model checking for TSO and PSO ⋮ Sound concurrent traces for online monitoring ⋮ On rank functions for heaps ⋮ Prefix-based tracing in message-passing concurrency ⋮ A cut-invariant law of large numbers for random heaps ⋮ Nested-unit Petri nets ⋮ On continuous time agents ⋮ A pragmatic approach to stateful partial order reduction ⋮ An algorithmic approach for checking closure properties of Ω-regular languages ⋮ Asynchronous cellular automata for pomsets without auto-concurrency ⋮ Independence Abstractions and Models of Concurrency ⋮ Causal-consistent replay debugging for message passing programs ⋮ The word problem for \(1\mathcal{LC}\) congruences is NP-hard. ⋮ The topology of Mazurkiewicz traces. ⋮ Weak morphisms of higher dimensional automata ⋮ Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions ⋮ Semantics of Deterministic Shared-Memory Systems ⋮ Modelling causality via action dependencies in branching time semantics ⋮ On some decision problems for trace codings ⋮ Complexity results for 1-safe nets ⋮ Logical definability on infinite traces ⋮ On the Origin of Events: Branching Cells as Stubborn Sets ⋮ Defining conditional independence using collapses ⋮ Formal verification of an executable LTL model checker with partial order reduction ⋮ True-concurrency probabilistic models: Markov nets and a law of large numbers ⋮ On the concatenation of infinite traces ⋮ Möbius functions and confluent semi-commutations ⋮ Mitigating covert channels based on analysis of the potential for communication ⋮ A calculus for automatic verification of Petri nets based on resolution and dynamic logics ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ From local to global temporal logics over Mazurkiewicz traces. ⋮ Synchronization of Bernoulli sequences on shared letters ⋮ A generalization of traces ⋮ Proof-relevant π-calculus: a constructive account of concurrency and causality ⋮ Asynchronous cellular automata for infinite traces ⋮ A trace semantics for Petri Nets ⋮ Logics and Bisimulation Games for Concurrency, Causality and Conflict ⋮ Quasi-optimal partial order reduction ⋮ On the Knuth-Bendix completion for concurrent processes ⋮ Word problems over traces which are solvable in linear time ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Operational and denotational semantics for the box algebra ⋮ A uniform approach to true-concurrency and interleaving semantics for Petri nets ⋮ On the Analysis of Petri Nets and their Synthesis from Process Languages ⋮ An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages ⋮ Stable trace automata vs. full trace automata ⋮ On interleaving behaviour of PT-nets ⋮ Petri nets, traces, and local model checking ⋮ Acyclic heaps of pieces. I. ⋮ Conduché property and tree-based categories ⋮ A self-stabilizing enumeration algorithm. ⋮ A partial order approach to branching time logic model checking. ⋮ Model-checking of correctness conditions for concurrent objects ⋮ Handshake Games ⋮ A truly concurrent semantics for a process algebra using resource pomsets ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces ⋮ Resource traces: A domain for processes sharing exclusive resources.

This page was built for publication: