Deriving a graph rewriting system from a complete finite prefix of an unfolding

Electronic Notes in Theoretical Computer Science

Volumn 27, Issue , 1999, Pages 25-41

  Langerak, Rom ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PETRI NETS; SEMANTICS;

CONDITION EVENT STRUCTURES; FINITE PREFIX; GRAPH REWRITING SYSTEM; PROCESS ALGEBRA;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 18944399278     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80293-2     Document Type: Conference Paper

References (21)

1. Bolognesi T., Brinksma E. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems. 14:1987;25-59
2. Boudol G., Castellani I. Flow models of distributed computations: three equivalent semantics for CCS. Information and Computation. 114:1994;247-314
3. Brinksma E., Katoen J.-P., Latella D., Langerak R. Partial-order models for quantitative extensions of LOTOS. Computer Networks and ISDN Systems. 30:(9/10):1998;925-950
4. Engelfriet J. Branching processes of Petri nets. Acta Informatica. 28:1991;575-591
5. Esparza J., Römer S., Vogler W. An improvement of McMillan's unfolding algorithm. Proc. TAG AS'96, volume 1055 of Lecture Notes in Computer Science. 1997;87-106 Springer-Verlag
6. Also appeared in Proc. TAPSOFT'93, volume 668 of Lecture Notes in Computer Science, pages 613-628. Springer-Verlag, 1993.
7. J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2):151-195, 1994.
8. Graves B. Computing reachability properties hidden in finite net unfoldings. Lecture Notes in Computer Science. 1055:1997;327-342
9. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice-Hall
10. Katoen, D. Latella, R. Langerak J.-P., Brinksma E., Bolognesi T. A consistent causality-based view on a timed process algebra including urgent interactions. Journal on Formal Methods for System Design. 12:(2):1998;189-216
11. Langerak R. Transformations and Semantics for LOTOS. PhD thesis, University of Twente. 1992
12. R. Langerak and E. Brinksma. A complete finite prefix for process algebra. In Proceedings of CAV'99, 1999. Accepted for publication.
13. McMillan K. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. Proc. CAV '92, Fourth Workshop on Computer-Aided Verification, volume 663 of Lecture Notes in Computer Science. 1992;164-174
14. McMillan K. Trace theoretic verification of asynchronous circuits using unfoldings. Proc. CAV '95, 7th International Conference on Computer-Aided Verification, volume 939 of Lecture Notes in Computer-Science. 1995;180-195 Springer-Verlag
15. McMillan K.L. A technique of state space search based on unfolding. Formal Methods in System Design. 6:1995;45-65
16. Nielsen M., Plotkin G.D., Winskel G. Petri nets, event structures and domains, part 1. Theoretical Computer Science. 13:(1):1981;85-108
17. Olderog E.-R. Nets, terms and formulas. 1991;Cambridge University Press
18. Quemener Y.-M., Jeron T. Finitely representing infinite reachability graphs of cfsms with graph grammars. Publication Interne 994, IRISA, Rennes, France. March 1996
19. Ulrich A., Koenig H. Specification-based testing of concurrent systems. Mizuno T., Shiratori N., Higashino T., Togashi A. Formal Description Techniques and Protocol Specification, Testing and Verification. 1997;7-22
20. F. Wallner. Model-checking LTL using net unfoldings. In Proc. CAV '98, 10th International Conference on Computer-Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 207-218, Vancouver, Canada, 1998.
21. Winskel G. An introduction to event structures. de Bakker W.-P., de Roever J.W., Rozenberg G. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science. 1989;364-397 Springer-Verlag