Symbolic unfolding of parametric stopwatch petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6252 LNCS, Issue , 2010, Pages 291-305

  Traonouez, Louis Marie ^a   Grabiec, Bartosz ^b   Jard, Claude ^b   Lime, Didier ^c   Roux, Olivier H ^c  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITÉ EUROPÉENNE DE BRETAGNE   (France)

^c UNIVERSITÉ DE NANTES   (France)

Author keywords

parameters; stopwatches; symbolic methods; time Petri nets; unfolding

Indexed keywords

CONCURRENT SEMANTICS; PARAMETERS; READ ARCS; SYMBOLIC METHODS; TIME PARAMETER; TIME PETRI NETS; TIMED PROCESS; UNFOLDING; UNFOLDING METHOD; UNFOLDINGS;

PETRI NETS; STOP WATCHES; SEMANTICS;

GRAPH THEORY; PETRI NETS;

EID: 78049338967     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15643-4_22     Document Type: Conference Paper

References (16)

1. Abdulla, P. A., Iyer, S. P., Nylen, A.: Unfoldings of unbounded Petri nets. In: Emerson, E. A., Sistla, A. P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 495-507. Springer, Heidelberg (2000)
2. Aura, T., Lilius, J.: A causal semantics for time Petri nets. Theoretical Computer Science 243(2), 409-447 (2000)
3. Baldan, P., Busi, N., Corradini, A., Pinna, G. M.: Functorial concurrent semantics for Petri nets with read and inhibitor arcs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 442-457. Springer, Heidelberg (2000)
4. Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. on Soft. Eng. 17(3), 259-273 (1991)
5. Berthomieu, B., Lime, D., Roux, O. H., Vernadat, F.: Reachability problems and abstract state spaces for time Petri nets with stopwatches. Journal of Discrete Event Dynamic Systems - Theory and Applications (DEDS) 17(2), 133-158 (2007)
6. Chatain, T., Jard, C.: Complete finite prefixes of symbolic unfoldings of safe time Petri nets. In: Donatelli, S., Thiagarajan, P. S. (eds.) ICATPN 2006. LNCS, vol. 4024, pp. 125-145. Springer, Heidelberg (2006)
7. Chatain, T., Jard, C.: Sémantique concurrente symbolique des réseaux de Petri saufs et dépliages finis des réseaux temporels. In: Proceedings of NOTERE, Tozeur, Tunisia. IEEE Computer Society Press, Los Alamitos (May-June 2010)
8. Esparza, J.: Model checking using net unfoldings. Science of Computer Programming 23, 151-195 (1994)
9. Esparza, J., Heljanko, K.: Unfoldings, A Partial-Order Approach to Model Checking. In: Monographs in Theoretical Computer Science. Springer, Heidelberg (2008)
10. Grabiec, B., Traonouez, L.-M., Jard, C., Lime, D., Roux, O. H.: Diagnosis using unfoldings of parametric time Petri nets. In: Proceedings of FORMATS, Vienna, Austria. LNCS. Springer, Heidelberg (to appear, September 2010)
11. Henzinger, T. A., Kopke, P. W., Puri, A., Varaiya, P.: What's decidable about hybrid automata? Journal of Computer and System Sciences 57, 94-124 (1998)
12. Khomenko, V., Koutny, M.: Branching processes of high-level Petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 458-472. Springer, Heidelberg (2003)
13. Lime, D., Roux, O. (H.): Formal verification of real-time systems with preemptive scheduling. Journal of Real-Time Systems 41(2), 118-151 (2009)
14. McMillan, K. L.: Using unfolding to avoid the state space explosion problem in the verification of asynchronous circuits. In: Probst, D. K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 164-177. Springer, Heidelberg (1993)
15. Merlin, P. M.: A study of the recoverability of computing systems. PhD thesis, Dep. of Information and Computer Science, University of California, Irvine, CA (1974)
16. Traonouez, L.-M., Lime, D., Roux, O. H.: Parametric model-checking of stopwatch Petri nets. Journal of Universal Computer Science (J. UCS) 15(17), 3273-3304 (2009)