The following pages link to (Q4733400):
Displaying 32 items.
- Extending propositional dynamic logic for Petri nets (Q281154) (← links)
- A calculus for automatic verification of Petri nets based on resolution and dynamic logics (Q530854) (← links)
- Automata for epistemic temporal logic with synchronous communication (Q616040) (← links)
- Modelling causality via action dependencies in branching time semantics (Q671596) (← links)
- Models for concurrency: Towards a classification (Q672053) (← links)
- Petri nets and bisimulation (Q672873) (← links)
- Synchronous Kleene algebra (Q710676) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- A metric for traces (Q911785) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- An algebraic characterization of independence of Petri net processes (Q1028983) (← links)
- Concurrent transition systems (Q1119395) (← links)
- Event structures and trace monoids (Q1183599) (← links)
- Elementary transition systems (Q1190485) (← links)
- On undecidability of propositional temporal logics on trace systems (Q1199555) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Logics and decidability for labelled pre- and partially ordered Kripke structures (Q1328764) (← links)
- Model checking properties on reduced trace systems (Q1736621) (← links)
- Algebra and theory of order-deterministic pomsets (Q1815430) (← links)
- Distributed automata in an assumption-commitment framework (Q1847547) (← links)
- Specifying reversibility with \(\mathrm{TLA}^+\) (Q2210867) (← links)
- A formal framework for the decentralised diagnosis of large scale discrete event systems and its application to telecommunication networks (Q2457674) (← links)
- Asynchronous games. II: The true concurrency of innocence (Q2503039) (← links)
- Producing Short Counterexamples Using “Crucial Events” (Q3512512) (← links)
- Determinizing asynchronous automata (Q4632421) (← links)
- Behavioural equivalence for infinite systems — Partially decidable! (Q4633177) (← links)
- Keeping track of the latest gossip in a distributed system (Q5137336) (← links)
- Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly (Q5739008) (← links)
- A generalized Kahn Principle for abstract asynchronous networks (Q5887509) (← links)
- Metric semantics for true concurrent real time (Q5940931) (← links)
- Models and logics for true concurrency. (Q5955751) (← links)
