The following pages link to Branching processes of Petri nets (Q1175711):
Displaying 50 items.
- Comparative trace semantics of time Petri nets (Q300337) (← links)
- On the expressive power of behavioral profiles (Q315288) (← links)
- What topology tells us about diagnosability in partial order semantics (Q351726) (← links)
- Efficient semantics-based compliance checking using LTL formulae and unfolding (Q364600) (← links)
- Computing the reveals relation in occurrence nets (Q391112) (← links)
- Recent advances in unfolding technique (Q403021) (← links)
- Petri games: synthesis of distributed systems with causal memory (Q515654) (← links)
- A multiset semantics for the pi-calculus with replication (Q672867) (← links)
- An event structure semantics for general Petri nets (Q672871) (← links)
- Process versus unfolding semantics for Place/Transition Petri nets (Q672872) (← links)
- Configuration structures, event structures and Petri nets (Q843106) (← links)
- Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)
- Verification of bounded Petri nets using integer programming (Q878111) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- An algebraic characterization of independence of Petri net processes (Q1028983) (← links)
- A causal semantic for time Petri nets (Q1575828) (← links)
- Petri nets are dioids: a new algebraic foundation for non-deterministic net theory (Q1713413) (← links)
- Distributed monitoring of concurrent and asynchronous systems (Q1773098) (← links)
- Clustering for Petri nets (Q1884880) (← links)
- Abstract processes of place/transition systems (Q1944098) (← links)
- Spreading nets: a uniform approach to unfoldings (Q1987731) (← links)
- A two-player asynchronous game on fully observable Petri nets (Q2032842) (← 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)
- The synthesis problem for repeatedly communicating Petri games (Q2165240) (← links)
- Solving high-level Petri games (Q2182671) (← links)
- Deadlock detection-oriented unfolding of unbounded Petri nets (Q2215072) (← links)
- ``Truly concurrent'' and nondeterministic semantics of discrete-time Petri nets (Q2216716) (← links)
- Combining free choice and time in Petri nets (Q2291812) (← links)
- Observable liveness of Petri nets (Q2340254) (← links)
- On the well-foundedness of adequate orders used for construction of complete unfolding prefixes (Q2380011) (← links)
- Parameter space abstraction and unfolding semantics of discrete regulatory networks (Q2422012) (← links)
- Trellis processes: a compact representation for runs of concurrent systems (Q2465670) (← links)
- On the expressiveness of higher dimensional automata (Q2491631) (← links)
- Non-atomic Transition Firing in Contextual Nets (Q2941146) (← links)
- An Algorithm for Direct Construction of Complete Merged Processes (Q3011883) (← links)
- How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings (Q3011884) (← links)
- Branching Processes of General Petri Nets (Q3011885) (← links)
- On Causal Semantics of Petri Nets (Q3090821) (← links)
- Branching Processes of Timed Petri Nets (Q3179184) (← links)
- Model Checking Data Flows in Concurrent Network Updates (Q3297609) (← links)
- Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP (Q3449628) (← links)
- Calculi of net structures and sets are similar (Q3515462) (← links)
- McMillan’s Complete Prefix for Contextual Nets (Q3599219) (← links)
- Oclets – Scenario-Based Modeling with Petri Nets (Q3636847) (← links)
- Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net (Q3648819) (← links)
- (Q4284252) (← links)
- (Q4417949) (← links)
- Model checking using net unfoldings (Q5044767) (← links)
- (Q5090956) (← links)
