The following pages link to (Q3670575):
Displaying 48 items.
- Mutex needs fairness (Q287028) (← links)
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
- Reachability trees for high-level Petri nets (Q579940) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- Proving nonreachability by modulo-invariants (Q672866) (← links)
- A multiset semantics for the pi-calculus with replication (Q672867) (← links)
- Trapping mutual exclusion in the box calculus (Q672869) (← links)
- Process versus unfolding semantics for Place/Transition Petri nets (Q672872) (← links)
- On the border of causality: contact and confusion (Q672875) (← links)
- Structure theory of equal conflict systems (Q672877) (← links)
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- Structure of concurrency (Q685384) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- Graph rewriting for a partial ordering semantics of concurrent constraints programming (Q685459) (← links)
- A theory of bipolar synchronization scheme (Q799113) (← links)
- A formal semantics for concurrent systems with a priority relation (Q1074338) (← links)
- Petri nets with individual tokens (Q1083212) (← links)
- Concurrent histories: a basis for observing distributed systems (Q1089787) (← links)
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- Inevitability in concurrent systems (Q1107977) (← links)
- Sequential and concurrent behaviour in Petri net theory (Q1119024) (← links)
- Concurrent systems and inevitability (Q1122355) (← links)
- A theory of implementation and refinement in timed Petri nets (Q1128980) (← links)
- Correctness of concurrent processes (Q1176236) (← links)
- Concurrent regular expressions and their relationship to Petri nets (Q1184987) (← links)
- On structural conditions for weak persistency and semilinearity of Petri nets (Q1186602) (← links)
- A calculus of mobile processes. I (Q1198548) (← links)
- An algebraic semantics for structured transition systems and its application to logic programs (Q1199528) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Operational and denotational semantics for the box algebra (Q1274445) (← links)
- An abstract machine for concurrent modular systems: CHARM (Q1314422) (← links)
- Completeness results for linear logic on Petri nets (Q1361243) (← links)
- On commoner's liveness theorem and supervisory policies that enforce liveness in free-choice Petri nets (Q1391343) (← links)
- Restrictions and representations of vector controlled concurrent system behaviours (Q1391736) (← links)
- On reachability equivalence for BPP-nets (Q1391745) (← links)
- Relational transducers for electronic commerce (Q1591155) (← links)
- Partial order semantics and read arcs (Q1608891) (← links)
- Specification of real-time and hybrid systems in rewriting logic (Q1608921) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- A true concurrency model of CCS semantics (Q1802071) (← links)
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP (Q1822234) (← links)
- Timed Petri nets in modeling and analysis of simple schedules for manufacturing cells (Q1963056) (← links)
- Planning temporal events using point-interval logic (Q2473196) (← links)
- Some observations on supervisory policies that enforce liveness in partially controlled free-choice Petri nets (Q2489594) (← links)
- Transformations of sequential specifications into concurrent specifications by synchronization guards (Q2638794) (← links)
- Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters (Q5179054) (← links)
- A Case for Using Signal Transition Graphs for Analysing and Refining Genetic Networks (Q5179422) (← links)
