Pages that link to "Item:Q1346650"
From MaRDI portal
The following pages link to A technique of state space search based on unfolding (Q1346650):
Displaying 33 items.
- Efficient semantics-based compliance checking using LTL formulae and unfolding (Q364600) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- An efficient algorithm for the parallel solution of high-dimensional differential equations (Q631906) (← links)
- Control of safe ordinary Petri nets using unfolding (Q816699) (← links)
- Untanglings: a novel approach to analyzing concurrent systems (Q903488) (← links)
- An improvement of McMillan's unfolding algorithm (Q1600655) (← links)
- Multilevel transitive and intransitive non-interference, causally (Q1680560) (← links)
- Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors (Q1723403) (← links)
- SAT-solving the coverability problem for Petri nets (Q1878911) (← links)
- Relational structures for concurrent behaviours (Q1998872) (← links)
- Petri nets semantics of reaction rules (RR). A language for ecosystems modelling (Q2165237) (← 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)
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences (Q2475807) (← links)
- Scheduling analysis of FMS: an unfolding timed Petri nets approach (Q2489623) (← links)
- Structure-based deadlock checking of asynchronous circuits (Q2637261) (← links)
- Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics (Q2822654) (← links)
- Computation of summaries using net unfoldings (Q2963916) (← links)
- Occurrence Nets Then and Now: The Path to Structured Occurrence Nets (Q3011878) (← links)
- Planning without state space explosion: Petri net to Markov decision process (Q3393989) (← links)
- Failures: Their Definition, Modelling and Analysis (Q3525090) (← links)
- Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic (Q3614879) (← links)
- A structural approach for the analysis of Petri Nets by reduced unfoldings (Q4633172) (← links)
- A Theory of Distributed Markov Chains (Q4988963) (← links)
- Model checking using net unfoldings (Q5044767) (← links)
- (Q5090956) (← links)
- A Programming Language for Spatial Distribution of Net Systems (Q5166761) (← links)
- Flow Unfolding of Multi-clock Nets (Q5166763) (← links)
- Non-interference by Unfolding (Q5166764) (← links)
- FM 2005: Formal Methods (Q5716887) (← links)
- Taking complete finite prefixes to high level, symbolically (Q6535189) (← links)
- Taking complete finite prefixes to high level, symbolically (Q6622143) (← links)