64 search results - page 5 / 13 » A Symbolic Algorithm for the Synthesis of Bounded Petri Nets |
DEDS
1998
13 years 7 months ago
1998
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
Software synthesis from a concurrent functional specification is a key problem in the design of embedded systems. A concurrent specification is well-suited for medium-grained part...
CODES
2003
IEEE
14 years 1 months ago
2003
IEEE
Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical pat...
ACSD
2004
IEEE
13 years 11 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
AUTOMATICA
2005
13 years 7 months ago
2005
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing t...