scientific article; zbMATH DE number 4119618
From MaRDI portal
Recommendations
Cited in
(43)- An algebraic characterization of independence of Petri net processes
- Theory of traces
- Concurrent transition systems
- Event structures and trace monoids
- Elementary transition systems
- On undecidability of propositional temporal logics on trace systems
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
- Representation of computations in concurrent automata by dependence orders
- Logics and decidability for labelled pre- and partially ordered Kripke structures
- Model checking properties on reduced trace systems
- Algebra and theory of order-deterministic pomsets
- Distributed automata in an assumption-commitment framework
- Specifying reversibility with \(\mathrm{TLA}^+\)
- A formal framework for the decentralised diagnosis of large scale discrete event systems and its application to telecommunication networks
- Asynchronous games. II: The true concurrency of innocence
- Extending propositional dynamic logic for Petri nets
- On three alternative characterizations of combined traces
- Producing Short Counterexamples Using “Crucial Events”
- scientific article; zbMATH DE number 3924146 (Why is no real title available?)
- scientific article; zbMATH DE number 3938548 (Why is no real title available?)
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- scientific article; zbMATH DE number 4092788 (Why is no real title available?)
- scientific article; zbMATH DE number 1101603 (Why is no real title available?)
- Determinizing asynchronous automata
- Behavioural equivalence for infinite systems -- partially decidable!
- Keeping track of the latest gossip in a distributed system
- A calculus for automatic verification of Petri nets based on resolution and dynamic logics
- Merging relations: a way to compact Petri nets' behaviors uniformly
- A generalized Kahn Principle for abstract asynchronous networks
- Metric semantics for true concurrent real time
- Models and logics for true concurrency.
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
- Automata for epistemic temporal logic with synchronous communication
- Languages and logical definability in concurrency monoids
- Modelling causality via action dependencies in branching time semantics
- Models for concurrency: Towards a classification
- Petri nets and bisimulation
- The categorical contours of the Chomsky-Schützenberger representation theorem
- Compositional transformational design for concurrent programs
- Synchronous Kleene algebra
- The parallel complexity of two problems on concurrency
- A metric for traces
- Word problems over traces which are solvable in linear time
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 Q4733400)
