Real-time systems design with PEP

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

Volumn 2280 LNCS, Issue , 2002, Pages 476-480

  Stehno, Christian ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE COMPUTER SYSTEMS; TIME SHARING SYSTEMS;

INTEGRATED DEVELOPMENT; MUTUAL EXCLUSION ALGORITHMS; PARALLEL SYSTEM; PARTIAL ORDER; REAL TIME MODELING; TIMED SYSTEMS; VERIFICATION ENVIRONMENT;

REAL TIME SYSTEMS;

EID: 67650293006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46002-0_35     Document Type: Conference Paper

References (16)

1. Abadi, M., Lamport, L.: An Old-Fashioned Recipe for Real-Time. In Real Time: Theory in Practice. Volume 600 of LNCS. Springer-Verlag (1992) 1-27
2. Best, E., Devillers, R., Hall, J.: The Box Calculus: a New Causal Algebra with Multi-Label Communication. In Proc. of APN'92. Volume 609 of LNCS. Springer-Verlag (1992) 21-69
3. 2 - a Basic Petri Net Programming Notation. In Proc. of PARLE'93. Volume 694 of LNCS. Springer-Verlag (1993) 379-390
4. Bieber, B., Fleischhack, H.: Model Checking of Time Petri Nets Based on Partial Order Semantics. In Proc. of Concur'99. Volume 1664 of LNCS. Springer-Verlag (1999) 210-225
5. Esparza, J.: Model Checking Using Net Unfoldings. Science of Computer Programming 23. Elsevier (1994) 151-195
6. Esparza, J., Römer, S., Vogler, W.: An Improvement of McMillan's Unfolding Algorithm. In Proc. of TACAS'96. Volume 1055 of LNCS. Springer-Verlag (1996) 87-106
7. Fleischhack, H., Grahlmann, B.: A Compositional Petri Net Semantics for SDL. In Proc. of ATPN'98. Volume 1420 of LNCS. Springer-Verlag (1998)
8. Fleischhack, H., Stehno, C.: Computing the Finite Prefix of a Time Petri Net. Submitted paper. 2001
9. Grahlmann, G., Moeller, M., Anhalt, U.: A New Interface for the PEP Tool - Parallel Finite Automata. In Proc. of AWPN'95, AIS 22. FB10 Universität Oldenburg (1995)
10. Heljanko, K.: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. In Proc. of TACAS'99. Volume 1579 of LNCS. Springer-Verlag (1999) 240-254
11. Jaeger, J.: Portable Codegenerierung für eine parallele Programmiersprache. Masters thesis. Universität Hildesheim (1997) in German
12. Khomenko, V., Koutny, M.: LP Deadlock Checking Using Partial Order Dependencies. In Proc. of CONCUR'2000. Volume 1877 of LNCS. Springer-Verlag (2000) 410-425
13. Koutny, M.: A Compositional Model of Time Petri Nets. In Proc. of Application and Theory of Petri Nets 2000. Volume 1825 of LNCS. Springer-Verlag (2000) 303-322
14. McMillan, K.: Symbolic model checking: An approach to the state explosion problem. Kluwer Academic Publishers (1993)
15. Merlin, P., Faber, D.: Recoverability of Communication Protocols - Implication of a Theoretical Study. IEEE Transactions on Software Communications 24 (1976) 1036-1043
16. Starke, P.: INA - Integrated Net Analyzer Version 2.2. Humboldt-Universität Berlin (1999)