Minimal transition systems for history-preserving bisimulation

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

Volumn 1200, Issue , 1997, Pages 413-425

  Montanari, Ugo ^a   Pistore, Marco ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

HISTORY PRESERVING BISIMULATION; MINIMAL REALIZATIONS; MINIMAL TRANSITION; NEW APPROACHES; PARTIAL ORDER SEMANTICS; TRANSITION SYSTEM;

PETRI NETS;

EID: 84949685048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023477     Document Type: Conference Paper

References (17)

1. E. Best, R. Devillers, A. Kiehn and L. Pomello. Fully concurrent bisimulation. Acta Informatica 28:231-264, 1991.
2. A. Bouali, S. Gnesi and S. Larosa. The integration project for the JACK environment. In EATCS Bullettin, 1994.
3. G. Boudol, I. Castellani, M. Hennessy and A. Kiehn. Observing localities. Theoretical Computer Science 114:31-61, 1993.
4. Ph. Darondeau and P. Degano. Causal trees. In Proc. ICALP'89, LNCS 372. Springer-Verlag, 1989.
5. P. Degano, R. De Nicola and U. Montanari. Observational equivalences for concurrency models. In Proc. Formal Description of Programming Concepts - III, 1986. North-Holland, 1987.
6. P. Degano, R. De Nicola and U. Montanari. Partial orderings descriptions and observations of nondeterministic concurrent processes. In Proc. REX School/Workshop on Linear Time, Branching Time and Partial Orders in Logica and Models for Concurrency, LNCS 354. Springer Verlag, 1989.
7. U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control 57:125-147, 1983.
8. L. Jategaonkar and A. Meyer. Deciding true concurrency equivalences on finite safe nets. Theoretical Computer Science 154:107-143, 1996. Extended abstract in Proc. ICALP'93, LNCS 700. Springer Verlag, 1993.
9. B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of nonfinite-state programs. Information and Computation 107:272-302, 1993.
10. P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86:43-68, 1990.
11. U. Montanari and M. Pistore. Checking bisimilarity for finitary π-calculus. In Proc. CONCUR'95, LNCS 962. Springer Verlag, 1995.
12. U. Montanari and M. Pistore. History-dependent automata. Draft. Available as ftp://ftp.di.unipi.it/pub/Papers/pistore/HDautomata.ps.gz. Also: Technical Report, Università di Pisa, to appear.
13. U. Montanari, M. Pistore and D. Yankelevich. Efficient minimization up to location equivalence. In Proc. ESOP'96, LNCS 1058. Springer Verlag, 1996.
14. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
15. A. Rabinovich and B. A. Trakhtenbrot. Behaviour structures and nets. Fundamenta Informaticae 11:357-404, 1988.
16. R. Valk and M. Jantzen. The residue vector sets with applications to decidability problems in Petri nets. In Proc. APN'84, LNCS 188. Springer Verlag, 1984.
17. W. Vogler. Deciding history preserving bisimilarity. In Proc. ICALP'91, LNCS 510. Springer Verlag, 1991.