Sciweavers

15 search results - page 2 / 3
» Bounded Synthesis for Petri Games
Sort
View
ACSD
2008
IEEE
114views Hardware» more  ACSD 2008»
13 years 12 months ago
Modeling and verifying asynchronous communication mechanisms using coloured Petri nets
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, two automati...
Kyller Costa Gorgônio, Fei Xia
APN
2009
Springer
14 years 2 days ago
Hasse Diagram Generators and Petri Nets
In [LJ06] Lorenz and Juh´as raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets...
Mateus de Oliveira Oliveira
FSTTCS
2010
Springer
13 years 3 months ago
Generalized Mean-payoff and Energy Games
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
FORMATS
2008
Springer
13 years 7 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
VLSID
2003
IEEE
123views VLSI» more  VLSID 2003»
14 years 5 months ago
Synthesis of Real-Time Embedded Software by Timed Quasi-Static Scheduling
A formal synthesis method for complex real-time embedded software is proposed in this work. Compared to previous work, our method not only synthesizes embedded software with compl...
Pao-Ann Hsiung, Feng-Shi Su