scientific article; zbMATH DE number 3735177
From MaRDI portal
Publication:3922196
Cited in
(80)- Executability of scenarios in Petri nets
- Theory of traces
- The equational theory of pomsets
- Concurrency and atomicity
- Executions: A new partial-order semantics of Petri nets
- A uniform approach to true-concurrency and interleaving semantics for Petri nets
- Finite Petri nets as models for recursive causal behaviour
- Axiomatizing shuffle and concatenation in languages
- Series-parallel languages and the bounded-width property
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- Two equational theories of partial words
- On series-parallel pomset languages: rationality, context-freeness and automata
- Interval semantics for Petri nets with inhibitor arcs
- CCS with Hennessy's merge has no finite-equational axiomatization
- Schedulers and finishers: on generating and filtering the behaviours of an event structure
- Algebra and theory of order-deterministic pomsets
- Rationality in algebras with a series operation
- Towards a language theory for infinite N-free pomsets.
- Lattice-based sum of t-norms on bounded lattices
- A categorical framework for learning generalised tree automata
- Synthesis of (choice-free) reset nets
- Firing partial orders in a Petri net
- Learning pomset automata
- Labeled posets are universal
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Posets with interfaces as a model for concurrency
- Catoids and modal convolution algebras
- r-multisemigroups, modal quantales and the origin of locality
- Modeling quantitative aspects of concurrent systems using weighted Petri net transducers
- Developments in concurrent Kleene algebra
- Concurrent Kleene algebra with tests and branching automata
- Concurrent Kleene Algebra
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Unifying Petri Net Semantics with Token Flows
- Pomset Languages of Finite Step Transition Systems
- An extension of the notions of traces and of asynchronous automata
- Normalization of place/transition-systems preserves net behaviour
- Nonfinite axiomatizability of the equational theory of shuffle
- The limit of \(\operatorname{split}_n\)-language equivalence
- Algebraic and graph-theoretic properties of infiniten-posets
- Equational Theories of Scattered and Countable Series-Parallel Posets
- Efficient rewriting in cograph trace monoids
- Languages of higher-dimensional automata
- Convolution and concurrency
- scientific article; zbMATH DE number 7559485 (Why is no real title available?)
- Temporal structures
- Free shuffle algebras in language varieties extended abstract
- Nonfinite axiomatizability of shuffle inequalities
- Generating Posets Beyond N
- scientific article; zbMATH DE number 7204945 (Why is no real title available?)
- Equivalence checking for weak bi-Kleene algebra
- Modeling concurrency with interval traces
- On weighted Petri net transducers
- Kleene theorems for product systems
- Kleene Theorems for Synchronous Products with Matching
- Convolution as a Unifying Concept
- Concurrent Kleene algebra and its foundations
- Kleene algebra with observations
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
- On relating concurrency and nondeterminism
- Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
- On the homomorphism order of labeled posets
- A Myhill-Nerode theorem for higher-dimensional automata
- Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets
- Closure and decision properties for higher-dimensional automata
- Myhill-Nerode theorem for higher-dimensional automata
- Free shuffle algebras in language varieties
- Fairness and partial order semantics
- Bisimulation and action refinement
- Pomsets with boxes: protection, separation, and locality in concurrent Kleene algebra
- Closure and decision properties for higher-dimensional automata
- Irrationality of process replication for higher-dimensional automata
- Presenting interval pomsets with interfaces
- Kleene theorem for higher-dimensional automata
- Logic and languages of higher-dimensional automata
- Branching automata with costs -- a way of reflecting parallelism in costs
- Denotational semantics for probabilistic and concurrent programs
- Failures semantics based on interval semiwords is a congruence for refinement
- Partial commutations and faithful rational transductions
- Axiomatizing the identities of binoid languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922196)
