Causal computing

[1]  Marco Pistore,et al.  Minimal Transition Systems for History-Preserving Bisimulation , 1997, STACS.

[2]  Francesca Rossi,et al.  Graph Processes , 1996, Fundam. Informaticae.

[3]  Cosimo Laneve,et al.  Axiomatizing permutation equivalence , 1996, Mathematical Structures in Computer Science.

[4]  Marco Pistore,et al.  Efficient Minimization up to Location Equivalence , 1996, ESOP.

[5]  Francesca Rossi,et al.  Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization (Extended Abstract) , 1996, COORDINATION.

[6]  José Meseguer,et al.  Process versus Unfolding Semantics for Place/Transition Petri Nets , 1996, Theor. Comput. Sci..

[7]  Ugo Montanari,et al.  Location Equivalence in Parametric Setting , 1995, Theor. Comput. Sci..

[8]  Marco Pistore,et al.  Checking Bisimilarity for Finitary pi-Calculus , 1995, CONCUR.

[9]  Gian Luigi Ferrari,et al.  Dynamic Matrices and the Cost Analysis of Concurrent Programs , 1995, AMAST.

[10]  Marco Roccetti,et al.  A Theory of Processes with Durational Actions , 1995, Theor. Comput. Sci..

[11]  Roberto Gorrieri,et al.  On the Implementation of Concurrent Calculi in Net Calculi: Two Case Studies , 1995, Theor. Comput. Sci..

[12]  Fabio Gadducci,et al.  Relating Two Categorial Models of Term Rewriting , 1995, RTA.

[13]  Hartmut Ehrig,et al.  An Event Structure Semantics for Graph Grammars with Parallel Productions , 1994, TAGT.

[14]  Ilaria Castellani,et al.  Flow Models of Distributed Computations: Three Equivalent Semantics for CCS , 1994, Inf. Comput..

[15]  Francesca Rossi,et al.  From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semantics , 1994, ALP.

[16]  Francesca Rossi,et al.  Towards a Concurrent Semantics based Analysis of CC and CLP , 1994, PPCP.

[17]  Hartmut Ehrig,et al.  Note on standard representation of graphs and graph derivations , 1994 .

[18]  David Murphy,et al.  On the Ill-Timed but Well-Caused , 1993, CONCUR.

[19]  Matthew Hennessy,et al.  Observing Localities , 1993, Theor. Comput. Sci..

[20]  Francesca Rossi,et al.  Contextual Occurence Nets and Concurrent Constraint Programming , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[21]  Hartmut Ehrig,et al.  Abstract Graph Derivations in the Double Pushout Approach , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[22]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[23]  Ugo Montanari,et al.  An Algebraic Semantics for Structured Transition Systems and its Applications to Logic Programs , 1992, Theor. Comput. Sci..

[24]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[25]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[26]  Ugo Montanari,et al.  Axiomatizing net computations and processes , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[27]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[28]  Ernst-Rüdiger Olderog,et al.  Operational Petri net semantics for CCSP , 1986, European Workshop on Applications and Theory of Petri Nets.

[29]  Alan Mycroft,et al.  On the Relationship of CCS and Petri Nets , 1984, ICALP.

[30]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.