scientific article

zbMath0577.68061MaRDI QIDQ3698316

Antoni Mazurkiewicz

Publication date: 1984

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

zbMATH Keywords

Petri netdependence graphsevent domainoccurrence netsCOSY systemabstract algebra of processesanalysis of concurrent systemsformal description of the path expressions semanticsformal reasoning about concurrent program schemataoccurrence graphsprocesses with partially ordered set of event occurrencesstring vectors

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Semigroups in automata theory, linguistics, etc. (20M35) Theory of operating systems (68N25) Theory of computing (68Q99)

Related Items (28)

Traces, dependency graphs and DNLC grammars ⋮ On the membership problem for regular DNLC grammars ⋮ Concurrent and maximally concurrent evolution of nonsequential systems ⋮ On regular trace languages ⋮ On the decidability of some problems about rational subsets of free partially commutative monoids ⋮ An extension of the notions of traces and of asynchronous automata ⋮ Overlaps in free partially commutative monoids ⋮ Theory of traces ⋮ Complete subgraphs of bipartite graphs and applications to trace languages ⋮ Concurrent systems and inevitability ⋮ Concurrency and atomicity ⋮ Trace languages defined by regular string languages ⋮ On confluence versus strong confluence for one-rule trace-rewriting systems ⋮ Timing and causality in process algebra ⋮ Decidability and complexity for quiescent consistency and its variations ⋮ One-rule trace-rewriting systems and confluence ⋮ Abstraction for concurrent objects ⋮ Trace monoids with some invertible generators: Two decision problems ⋮ Executions: A new partial-order semantics of Petri nets ⋮ Bicategories of processes ⋮ Semicommutations and algebraic languages ⋮ A generalization of traces ⋮ Direct and dual laws for automata with multiplicities ⋮ The lattices of prefixes and overlaps of traces ⋮ Sheaves, Objects, and Distributed Systems ⋮ Characterizations of the decidability of some problems for regular trace languages ⋮ Atomic semicommutations ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces

This page was built for publication: