Pages that link to "Item:Q1119024"
From MaRDI portal
The following pages link to Sequential and concurrent behaviour in Petri net theory (Q1119024):
Displaying 44 items.
- Localities in systems with a/sync communication (Q418785) (← links)
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- Process semantics of general inhibitor nets (Q598184) (← links)
- An axiomatization of the algebra of Petri net concatenable processes (Q672052) (← links)
- An event structure semantics for general Petri nets (Q672871) (← links)
- Process versus unfolding semantics for Place/Transition Petri nets (Q672872) (← links)
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
- Using transition set sequences to partition behaviors of Petri nets (Q766188) (← links)
- Configuration structures, event structures and Petri nets (Q843106) (← links)
- Partial order behaviour and structure of Petri nets (Q911779) (← links)
- Some behavioural aspects of net theory (Q913516) (← links)
- Petri nets are monoids (Q922720) (← links)
- A compositional Petri net translation of general \(\pi\)-calculus terms (Q939164) (← links)
- Processes of membrane systems with promoters and inhibitors (Q953547) (← links)
- M-nets: a survey (Q1006339) (← links)
- An algebraic characterization of independence of Petri net processes (Q1028983) (← links)
- Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
- Executions: A new partial-order semantics of Petri nets (Q1183595) (← links)
- Petri net semantics of priority systems (Q1190490) (← links)
- An algebraic semantics for structured transition systems and its application to logic programs (Q1199528) (← links)
- Operational and denotational semantics for the box algebra (Q1274445) (← links)
- An abstract machine for concurrent modular systems: CHARM (Q1314422) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- A causal semantic for time Petri nets (Q1575828) (← links)
- Interval semantics for Petri nets with inhibitor arcs (Q1749475) (← links)
- Functorial models for Petri nets (Q1854467) (← links)
- The box algebra = Petri nets + process expressions (Q1854558) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Abstract processes and conflicts in place/transition systems (Q2051771) (← links)
- A study on team bisimulation and H-team bisimulation for BPP nets (Q2055961) (← links)
- Pomset bisimulation and unfolding for reset Petri nets (Q2113378) (← links)
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- Planning as satisfiability: parallel plans and algorithms for plan search (Q2457605) (← links)
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) (Q2638769) (← links)
- Concurrent bisimulations in Petri nets (Q2639636) (← links)
- A Petri net model for membrane systems with dynamic structure (Q2655493) (← links)
- Reversible computation in nets with bonds (Q2667186) (← links)
- Branching Processes of General Petri Nets (Q3011885) (← links)
- The Mutex Paradigm of Concurrency (Q3011890) (← links)
- On Causal Semantics of Petri Nets (Q3090821) (← links)
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets (Q6137873) (← links)
