The following pages link to (Q3601861):
Displaying 24 items.
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- Parameterized verification of time-sensitive models of ad hoc network protocols (Q896913) (← links)
- The meaning of frozen tokens in live nets (Q1263991) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Complexity hierarchies beyond elementary (Q2828216) (← links)
- Petri Nets with Structured Data (Q2941152) (← links)
- On the Verification of Timed Ad Hoc Networks (Q3172855) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication (Q3636840) (← links)
- Linear equations with ordered data (Q5009439) (← links)
- Linear equations for unordered data vectors in $[D]^k\to{}Z^d$ (Q5060183) (← links)
- Data Centric Workflows for Crowdsourcing (Q5100748) (← links)
- SMT-based verification of data-aware processes: a model-theoretic approach (Q5139282) (← links)
- Dynamic Networks of Timed Petri Nets (Q5166770) (← links)
- Fast computations on ordered nominal sets (Q5918532) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)
- Parameterized broadcast networks with registers: from NP to the frontiers of decidability (Q6629529) (← links)
- Solvability of orbit-finite systems of linear equations (Q6649440) (← links)
