scientific article

Publication date: 1981

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

Petri net concurrent processes concurrency partial word trace language parallel execution path expression behavior of control structures of algorithms computation sequence set

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 (70)

Convolution as a Unifying Concept ⋮ Towards a language theory for infinite N-free pomsets. ⋮ Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ Developments in concurrent Kleene algebra ⋮ Concurrent Kleene algebra with tests and branching automata ⋮ Nonfinite axiomatizability of the equational theory of shuffle ⋮ Efficient rewriting in cograph trace monoids ⋮ Two equational theories of partial words ⋮ Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) ⋮ An extension of the notions of traces and of asynchronous automata ⋮ Concurrent Kleene Algebra ⋮ Normalization of place/transition-systems preserves net behaviour ⋮ Theory of traces ⋮ Languages of higher-dimensional automata ⋮ Axiomatizing the identities of binoid languages ⋮ The equational theory of pomsets ⋮ Convolution and concurrency ⋮ Concurrency and atomicity ⋮ Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers ⋮ Axiomatizing shuffle and concatenation in languages ⋮ Temporal structures ⋮ Free shuffle algebras in language varieties extended abstract ⋮ Posets with interfaces as a model for concurrency ⋮ Nonfinite axiomatizability of shuffle inequalities ⋮ Generating Posets Beyond N ⋮ Trade-offs in true concurrency: Pomsets and mazurkiewicz traces ⋮ On relating concurrency and nondeterminism ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Catoids and modal convolution algebras ⋮ Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks ⋮ Unnamed Item ⋮ On the homomorphism order of labeled posets ⋮ \( \ell r\)-multisemigroups, modal quantales and the origin of locality ⋮ On series-parallel pomset languages: rationality, context-freeness and automata ⋮ Executions: A new partial-order semantics of Petri nets ⋮ Learning pomset automata ⋮ Free shuffle algebras in language varieties ⋮ Fairness and partial order semantics ⋮ The limit of splitn-language equivalence ⋮ Interval semantics for Petri nets with inhibitor arcs ⋮ Modeling concurrency with interval traces ⋮ Labeled posets are universal ⋮ Bisimulation and action refinement ⋮ On Weighted Petri Net Transducers ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ Branching automata with costs -- a way of reflecting parallelism in costs ⋮ Concurrent Kleene algebra and its foundations ⋮ Algebraic and graph-theoretic properties of infiniten-posets ⋮ Unnamed Item ⋮ Schedulers and finishers: on generating and filtering the behaviours of an event structure ⋮ Kleene Theorems for Product Systems ⋮ Lattice-based sum of t-norms on bounded lattices ⋮ Executability of scenarios in Petri nets ⋮ Unnamed Item ⋮ Logic and rational languages of scattered and countable series-parallel posets ⋮ Unifying Petri Net Semantics with Token Flows ⋮ Pomset Languages of Finite Step Transition Systems ⋮ Algebra and theory of order-deterministic pomsets ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ A uniform approach to true-concurrency and interleaving semantics for Petri nets ⋮ Series-parallel languages and the bounded-width property ⋮ Unnamed Item ⋮ Rationality in algebras with a series operation ⋮ Partial commutations and faithful rational transductions ⋮ A categorical framework for learning generalised tree automata ⋮ Finite Petri nets as models for recursive causal behaviour ⋮ Kleene Theorems for Synchronous Products with Matching ⋮ Axiomatizing the subsumption and subword preorders on finite and infinite partial words ⋮ Synthesis of (choice-free) reset nets ⋮ Firing partial orders in a Petri net

This page was built for publication: