Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)

Electronic Notes in Theoretical Computer Science - Tập 27 - Trang 107-126 - 1999
Mario Bravetti1, Roberto Gorrieri1
1Dipartimento di Scienze dell'Informazione, Università di Bologna, Mura Anteo Zamboni, 7, 40127, Bologna, Italy

Tài liệu tham khảo

Aceto, 1994, “On “Axiomatising Finite Concurrent Processes””, SIAM Journal on Computing, 23, 852, 10.1137/S0097539793243600

Aceto, 1994, “A Static View of Localities”, Formal Aspects of Computing, 6, 201, 10.1007/BF01221099

Aceto, 1994, “Adding Action Refinement to a Finite Process Algebra”, Information and Computation, 115, 179, 10.1006/inco.1994.1096

M. Bravetti, M. Bernardo, R. Gorrieri, “Towards Performance Evaluation with General Distributions in Process Algebras”, in Proc. of the 9th Int. Conf. on Concurrency Theory (CONCUR '98), LNCS 1466:405-422, Nice (France), 1998

Boudol, 1994, “A theory of processes with localities”, Formal Aspects of Computing, 6, 165, 10.1007/BF01221098

M. Bravetti, R. Gorrieri, “Deciding and Asiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement”, Technical Report UBLCS-99-1, University of Bologna (Italy), 1999

M. Bravetti, R. Gorrieri, “Interactive Generalized Semi-Markov Processes”, to appear in Proc. of the 7th Int. Workshop on Process Algebras and Performance Modeling (PAPM '99), Zaragoza (Spain), September 1999

N. Busi, R.J. van Glabbeek, R. Gorrieri, “Axiomatising ST-Bisimulation Equivalence”, in Proc. of the IFIP Working Conf. on Programming Concepts, Methods and Calculi (PROCOMET '94), pp. 169-188, S. Miniato (Italy), 1994

Castellani, 1995, “Observing Distribution In Processes: Static and Dynamic Localities”, Int. Journal of Foundations of Computer Science, 6, 353, 10.1142/S0129054195000196

Darondeau, 1989, “Causal Trees”, Automata, Languages and Programming, LNCS, 372, 234, 10.1007/BFb0035764

Degano, 1995, “A causal operational semantics of action refinement”, Information and Computation, 122, 97, 10.1006/inco.1995.1142

R.J. van Glabbeek, “The refinement theorem for ST-bisimulation semantics”, in Proc. of the IFIP Working Conf. on Programming Concepts, Methods and Calculi (PROCOMET '90), pp. 27-52, Sea of Gallilea (Israel), 1990

R.J. van Glabbeek, U. Goltz, “Equivalence Notions f o r Concurrent Systems and Refinement of Actions”, Arbeitspapiere der GMD 366, Gesellschaft fur Mathematik und Datenverarbeitung MBH, 1989

Gorrieri, 2000, “Action Refinement”

R.J. van Glabbeek, F.W. Vaandrager, “Petri Net Models for Algebraic Theories of Concurrency”, in Proc. of the Conf. on Parallel Architectures and Languages Europe (PARLE '87), LNCS 259:224-242, Eindhoven (The Netherlands), 1987

Gorrieri, 1991, “The limit of split, bisimulations for CCS agents”, in Proc. of the Symp. on Mathematical Foundations of Computer Science (MFCS '91), LNCS, 520, 170

Gorrieri, 1995, “Split and ST Bisimulation Semantics”, Information and Computation, 118, 272, 10.1006/inco.1995.1066

Kiehn, 1997, “On the decidability of non-interleaving process equivalences”, Fundamenta Informaticae, 30, 18, 10.3233/FI-1997-30102

Milner, 1989

Milner, 1989, “A complete axiomatization for observational congruence of finite-state behaviours”, Information and Computation, 81, 227, 10.1016/0890-5401(89)90070-9

U. Montanari, M. Pistore, “Minimal Transition Systems for History-Preserving Bisimulation”, in Proc. of the 14th Symp. on Theoretical Aspects of Computer Science (STACS'97), LNCS 1200, 1997

Montanari, 1995, “Location Equivalence in Parametric Setting”, Theoretical Computer Science, 149, 299, 10.1016/0304-3975(94)00219-9

G. Plotkin, “A Structural Approach to Operational Semantics”, Technical Report DAIMI FN-19, Aarhus University, Department of Computer Science, Aarhus, 1981.

Rabinovich, 1988, “Behaviour Structures and Nets”, Fundamenta Informaticae, 11, 357, 10.3233/FI-1988-11404

Vogler, 1993, “Bisimulation and action refinement”, Theoretical Computer Science, 114, 173, 10.1016/0304-3975(93)90157-O

Thông tin
Thông tin xuất bản

Electronic Notes in Theoretical Computer Science

Tập 27

107-126

Thông tin tác giả