Input/output compatibility of reactive systems

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

Volumn 2517, Issue , 2002, Pages 360-377

  Carmona, Josep ^a   Cortadella, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Conformation; Input output compatibility; Observational equivalence; Petri nets; Reactive systems; Synchronous product; Trace theory

Indexed keywords

CONFORMATIONS; FORMAL METHODS; PETRI NETS; POLYNOMIAL APPROXIMATION;

INPUT/OUTPUT; OBSERVATIONAL EQUIVALENCES; REACTIVE SYSTEM; SYNCHRONOUS PRODUCTS; TRACE THEORY;

COMPUTER AIDED DESIGN;

EID: 84948162903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36126-x_22     Document Type: Conference Paper

References (18)

1. A. Arnold. Finite Transition Systems. Prentice Hall, 1994.
2. G. Berthelot. Checking Properties ofNets Using Transformations. In G. Rozenberg, editor, Advances in Petri Nets 1985, volume 222 of Lecture Notes in Computer Science, pages 19–40. Springer-Verlag, 1986.
3. Janusz A. Brzozowski and Carl-Johan H. Seger. Asynchronous Circuits. Springer- Verlag, 1995.
4. J. Carmona, J. Cortadella, and E. Pastor. Synthesis ofreactiv e systems: Application to asynchronous circuit design. In J. Cortadella, A. Yakovlev, and G. Rozenberg, editors, Advances in Concurrency and Hardware Design (ACHD). Springer-Verlag, 2002. (To appear). Available at http://www.lsi.upc.es/˜jcarmona/achd02.ps.gz.
5. R. de Nicola and M. C. B. Hennessy. Testing Equivalences for Processes. Theoretical Computer Science, 34(1-2):83–133, November 1984.
6. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, Cambridge, Great Britain, 1995.
7. David L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed- Independent Circuits. ACM Distinguished Dissertations. MIT Press, 1989.
8. G.J. Milne. CIRCAL: A calculus for circuit descriptions. Integration, the VLSI Journal, 1(2–3):121–160, October 1983.
9. A. Jerraya. Hardware-software codesign. IEEE Design and Test of Computers, 17:92–99, March 2000.
10. Mark B. Josephs. A state-based approach to communicating processes. Distributed Computing, 3:9–18, 1988.
11. A. V. Kovalyov. On complete reducibility ofsome classes ofP etri nets. In Proceedings of the 11th International Conference on Applications and Theory of Petri Nets, pages 352–366, Paris, June 1990.
12. Nancy A. Lynch and Mark R. Tuttle. An introduction to input/output automata. In CWI-Quarterly, volume 2, pages 219–246, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, September 1989.
13. R. Milner. A Calculus for Communicating Processes, volume 92 of Lecture Notes in Computer Science. Springer Verlag, 1980.
14. Robin Milner. Communication and Concurrency. Prentice-Hall, 1989.
15. Tadao Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541–574, April 1989.
16. Radu Negulescu. Process Spaces and Formal Verification of Asynchronous Circuits. PhD thesis, Department ofComputer Science, University ofW aterloo, Waterloo, Ontario, Canada, August 1998.
17. Tom Verhoeff. Analyzing specifications for delay-insensitive circuits. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 172–183, 1998.
18. M. Yoeli and A. Ginzburg. Lotos/cadp-based verification ofasync hronous circuits. Report CS-2001-09-2001, Technion - Computer Science Department, September 2001.