A complete axiomatization for observational congruence of prioritized finite-state behaviors

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

Volumn 1853, Issue , 2000, Pages 744-755

  Bravetti, Mario ^a   Gorrieri, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AXIOMATIZING; COMPLETE AXIOMATIZATIONS; FINITE STATE; OBSERVATIONAL CONGRUENCE; PROCESS ALGEBRAS; PROOF SYSTEM; RECURSIONS;

AUTOMATA THEORY;

EID: 84974603302     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_62     Document Type: Conference Paper

References (10)

1. E. Badouel, P. Darondeau, “On Guarded Recursion”, in Theoretical Computer Science 82(2):403-408, 1991
2. M. Bravetti, R. Gorrieri, “A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors”, Technical Report UBLCS-99-18, University of Bologna (Italy), 1999
3. R. Cleaveland, G. Luttgen, V. Natarajan, “A Process Algebra with Distributed Priorities”, in Proc. of the 7th Int. Conf. on Concurrency Theory (CONCUR '96), LNCS 1119:34-49, 1996
4. R. Cleaveland, G. Luttgen, V. Natarajan, “Priority in Process Algebras”, to appear in Handbook of Process Algebra, Elsevier, 2000
5. R. Cleaveland, M. Hennessy, “Priorities in Process Algebra”, in Information and Computation 87:58-77, 1990
6. H. Hermanns, M. Lohrey, “Priority and Maximal Progress Are Completely Axiomatisable (Extended Abstract)”, in Proc. of the 9th Int. Conf. on Concurrency Theory (CONCUR '98), LNCS 1466:237-252, Nice (France), 1998
7. H. Hermanns, M. Lohrey, “Observational Congruence in a Stochastic Timed Calculus with Maximal Progress”, Technical Report IMMD-VII/7-97, Universität Erlangen-Nürnberg, 1997
8. R. Milner, “Communication and Concurrency”, Prentice Hall, 1989.
9. R. Milner, “A complete axiomatization for observational congruence of finitestate behaviours”, in Information and Computation 81:227-247, 1989
10. V. Natarajan, I. Christoff, L. Christoff, R. Cleaveland, “Priorities and Abstraction in Process Algebra”, in Proc. of Foundations of Software Technology and Theoretical Computer Science, LNCS 880:217-230, 1994