The following pages link to (Q4954445):
Displayed 15 items.
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- On decidability of LTL model checking for process rewrite systems (Q1006890) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- Model checking the full modal mu-calculus for infinite sequential processes (Q1960527) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- Nominal Automata for Resource Usage Control (Q2914700) (← links)
- Honesty by Typing (Q2974791) (← links)
- On Yen’s Path Logic for Petri Nets (Q3646251) (← links)
- Deciding properties of integral relational automata (Q4632414) (← links)
- (Q5114831) (← links)
- (Q5136306) (← links)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems (Q5179053) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Constrained properties, semilinear systems, and Petri nets (Q6162100) (← links)