The following pages link to (Q4289279):
Displaying 44 items.
- Guiding Craig interpolation with domain-specific abstractions (Q300418) (← links)
- The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- Catalytic and communicating Petri nets are Turing complete (Q476166) (← links)
- Verification of membrane systems with delays via Petri nets with delays (Q496035) (← links)
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- Causal message sequence charts (Q843103) (← links)
- Fault diagnosis in discrete event systems modeled by partially observed Petri nets (Q843985) (← links)
- On reachability equivalence for BPP-nets (Q1391745) (← links)
- A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets (Q1960543) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- Bounded memory protocols (Q2339157) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Verifying chemical reaction network implementations: a pathway decomposition approach (Q2422010) (← links)
- Recursive Petri nets (Q2464034) (← links)
- Petri nets with name creation for transient secure association (Q2510386) (← links)
- Qualitative Analysis of VASS-Induced MDPs (Q2811349) (← links)
- Modelling Retrial-Upon-Conflict Systems with Product-Form Stochastic Petri Nets (Q2843056) (← links)
- Cut Elimination for Shallow Modal Logics (Q3010370) (← links)
- Vector Addition System Reversible Reachability Problem (Q3090839) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- Liveness of Parameterized Timed Networks (Q3449490) (← links)
- When to Move to Transfer Nets (Q3460877) (← links)
- Continuous Petri Nets: Expressive Power and Decidability Issues (Q3510807) (← links)
- Termination Problems in Chemical Kinetics (Q3541039) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- On the Expressive Power of Restriction and Priorities in CCS with Replication (Q3617733) (← links)
- (Q3621937) (← links)
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication (Q3636840) (← links)
- On Yen’s Path Logic for Petri Nets (Q3646251) (← links)
- (Q5002821) (← links)
- (Q5019696) (← links)
- Investigating Reversibility of Steps in Petri Nets (Q5025059) (← links)
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States (Q5089288) (← links)
- (Q5111645) (← links)
- Behaviour, Interaction and Dynamics (Q5403078) (← links)
- Long-Run Average Behavior of Vector Addition Systems with States (Q5875389) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5892174) (← links)
- Automated polyhedral abstraction proving (Q6535199) (← links)
- Decidability results in automata and process theory (Q6560390) (← links)
- Ackermannian completion of separators (Q6629446) (← links)
