The following pages link to Contextual nets (Q1902298):
Displaying 44 items.
- Catalytic and communicating Petri nets are Turing complete (Q476166) (← links)
- Modeling concurrency with interval traces (Q515576) (← links)
- Unfolding semantics of graph transformation (Q879600) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- Executability of scenarios in Petri nets (Q1006647) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- An abstract machine for concurrent modular systems: CHARM (Q1314422) (← links)
- Comparing three semantics for Linda-like languages (Q1575148) (← links)
- Analysis issues in Petri nets with inhibitor arcs (Q1606123) (← links)
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
- Partial order semantics and read arcs (Q1608891) (← links)
- Interval semantics for Petri nets with inhibitor arcs (Q1749475) (← links)
- Normal forms for algebras of connections. (Q1853455) (← links)
- On the expressiveness of Linda coordination primitives. (Q1854324) (← links)
- Contextual Petri nets, asymmetric event structures, and processes (Q1854468) (← links)
- Domain and event structure semantics for Petri nets with read and inhibitor arcs (Q1882900) (← links)
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
- A Petri net view of covalent bonds (Q2077408) (← links)
- Pomset bisimulation and unfolding for reset Petri nets (Q2113378) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- Branching cells for asymmetric event structures (Q2253176) (← links)
- Modeling biological gradient formation: combining partial differential equations and Petri nets (Q2311279) (← links)
- Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
- Step semantics of Boolean nets (Q2376982) (← links)
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences (Q2475807) (← links)
- On Interval Process Semantics of Petri Nets with Inhibitor Arcs (Q2941144) (← links)
- Non-atomic Transition Firing in Contextual Nets (Q2941146) (← links)
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems (Q2944903) (← links)
- Asynchronous Traces and Open Petri Nets (Q3460864) (← links)
- Time and Fairness in a Process Algebra with Non-blocking Reading (Q3599073) (← links)
- McMillan’s Complete Prefix for Contextual Nets (Q3599219) (← links)
- Mobile Petri nets (Q3655764) (← links)
- (Q4222788) (← links)
- (Q4553276) (← links)
- Efficiency of asynchronous systems and read arcs in petri nets (Q4571984) (← links)
- Non sequential semantics for contextual P/T nets (Q4633159) (← links)
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework (Q4923514) (← links)
- Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra (Q4923515) (← links)
- Concurrency for Graph Grammars in a Petri net shell (Q4923530) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
- (Q5028437) (← links)
- (Q5207054) (← links)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)
