scientific article; zbMATH DE number 4119618

zbMath0683.68032MaRDI QIDQ4733400

Antoni Mazurkiewicz

Publication date: 1989

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

zbMATH Keywords

Petri netsconcurrencytracespartial orderingprocesses

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items (33)

Logics and decidability for labelled pre- and partially ordered Kripke structures ⋮ A generalized Kahn Principle for abstract asynchronous networks ⋮ Extending propositional dynamic logic for Petri nets ⋮ Concurrent transition systems ⋮ Automata for epistemic temporal logic with synchronous communication ⋮ Trade-offs in true concurrency: Pomsets and mazurkiewicz traces ⋮ Producing Short Counterexamples Using “Crucial Events” ⋮ A metric for traces ⋮ Word problems over traces which are solvable in linear time ⋮ Specifying reversibility with \(\mathrm{TLA}^+\) ⋮ Keeping track of the latest gossip in a distributed system ⋮ Determinizing asynchronous automata ⋮ Behavioural equivalence for infinite systems — Partially decidable! ⋮ A formal framework for the decentralised diagnosis of large scale discrete event systems and its application to telecommunication networks ⋮ Event structures and trace monoids ⋮ Model checking properties on reduced trace systems ⋮ Modelling causality via action dependencies in branching time semantics ⋮ Models for concurrency: Towards a classification ⋮ Petri nets and bisimulation ⋮ Elementary transition systems ⋮ On undecidability of propositional temporal logics on trace systems ⋮ Decidability of the star problem in \(A^*\times{}\{ b\}^*\) ⋮ A calculus for automatic verification of Petri nets based on resolution and dynamic logics ⋮ Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly ⋮ Metric semantics for true concurrent real time ⋮ Synchronous Kleene algebra ⋮ Asynchronous games. II: The true concurrency of innocence ⋮ Models and logics for true concurrency. ⋮ Algebra and theory of order-deterministic pomsets ⋮ Representation of computations in concurrent automata by dependence orders ⋮ An algebraic characterization of independence of Petri net processes ⋮ Distributed automata in an assumption-commitment framework ⋮ The parallel complexity of two problems on concurrency

This page was built for publication: