The following pages link to Raymond Devillers (Q218984):
Displaying 22 items.
- (Q4948013) (← links)
- Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks (Q4988953) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis (Q5025057) (← links)
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues (Q5044399) (← links)
- A New Property of Choice-Free Petri Net Systems (Q5100751) (← links)
- Synthesis of Persistent Systems (Q5166759) (← links)
- Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters (Q5179054) (← links)
- (Q5183051) (← links)
- Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods (Q5212019) (← links)
- (Q5357699) (← links)
- Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets (Q5404909) (← links)
- Formal Techniques for Networked and Distributed Systems – FORTE 2004 (Q5464478) (← links)
- (Q5472874) (← links)
- (Q5480176) (← links)
- (Q5567486) (← links)
- Recursion and Petri nets (Q5950717) (← links)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)
- Petri boxes and finite precedence (Q6162099) (← links)
- On the reversibility of circular conservative Petri nets (Q6535198) (← links)
- An efficient state space construction for a class of timed automata (Q6550569) (← links)
