Sciweavers

1099 search results - page 15 / 220
» Petri net ontology
Sort
View
AWPN
2008
249views Algorithms» more  AWPN 2008»
15 years 7 months ago
Towards Synthesis of Petri Nets from General Partial Languages
In this paper we investigate synthesis of place/transition Petri nets from three different finite representations of infinite partial languages, generalizing previous results.
Robert Lorenz
INFSOF
2002
85views more  INFSOF 2002»
15 years 5 months ago
A methodology of testing high-level Petri nets
Petri nets have been extensively used in the modelling and analysis of concurrent and distributed systems. The veri
Hong Zhu, Xudong He
MFCS
2010
Springer
15 years 4 months ago
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen
EMSOFT
2005
Springer
15 years 11 months ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
JAIR
2006
111views more  JAIR 2006»
15 years 6 months ago
Representing Conversations for Scalable Overhearing
Open distributed multi-agent systems are gaining interest in the academic community and in industry. In such open settings, agents are often coordinated using standardized agent c...
Gery Gutnik, Gal A. Kaminka