Abstract Semantics by Observable Contexts

The operational behavior of interactive systems is usually given in terms of transition systems labeled with actions, which, when visible, represent both observations and interactions with the external world. The abstract semantics is given in terms of behavioral equivalences, which depend on the action labels and on the amount of branching structure considered. Behavioural equivalences are often congruences with respect to the operations of the language, and this property expresses the compositionality of the abstract semantics.

[1]  Alexander Kurz.  A Co-Variety-Theorem for Modal Logic , 1998, Advances in Modal Logic.

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

[3]  Emilio Tuosto,et al.  Model Checking for Nominal Calculi , 2005, FoSSaCS.

[4]  Hartmut Ehrig,et al.  Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting , 2004, FoSSaCS.

[5]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[6]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[7]  Fabio Gadducci,et al.  A Concurrent Graph Semantics for Mobile Ambients , 2001, MFPS.

[8]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[9]  Hartmut Ehrig,et al.  Parallelism and concurrency in high-level replacement systems , 1991, Mathematical Structures in Computer Science.

[10]  Roberto Bruni,et al.  Deriving Weak Bisimulation Congruences from Reduction Systems , 2005, CONCUR.

[11]  Gian Luigi Ferrari,et al.  JSCL: A Middleware for Service Coordination , 2006, FORTE.

[12]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[13]  Christopher Strachey,et al.  Toward a mathematical semantics for computer languages , 1971 .

[14]  Roberto Bruni,et al.  Bisimulation by Unification , 2002, AMAST.

[15]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[16]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[17]  Roberto M. Amadio,et al.  A synchronous pi-calculus , 2015 .

[18]  Ugo Montanari,et al.  CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements , 2007, ESOP.

[19]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .

[20]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[21]  Philippa Gardner,et al.  Strong Bisimulation for the Explicit Fusion Calculus , 2004, FoSSaCS.

[22]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[23]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[24]  Fabio Gadducci,et al.  Process Bisimulation Via a Graphical Encoding , 2006, ICGT.

[25]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[26]  Sergiu Rudeanu,et al.  Semirings in Operations Research and Computer Science: More Algebra , 2004, Fundam. Informaticae.

[27]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[28]  Joseph A. Goguen,et al.  What Is Unification?: A Categorical View of Substitution, Equation and Solution , 1989 .

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

[30]  Antonio Brogi,et al.  A behavioural congruence for web services , 2007, FSEN'07.

[31]  G. M. Kelly,et al.  BASIC CONCEPTS OF ENRICHED CATEGORY THEORY , 2022, Elements of ∞-Category Theory.

[32]  Roberto Bruni,et al.  An interactive semantics of logic programming , 2001, Theory and Practice of Logic Programming.

[33]  Davide Sangiorgi,et al.  A Fully Abstract Model for the [pi]-calculus , 1996, Inf. Comput..

[34]  Fabio Gadducci,et al.  Enhancing Constraints Manipulation in Semiring-Based Formalisms , 2006, ECAI.

[35]  Vladimiro Sassone,et al.  A Congruence for Petri Nets , 2005, PNGT@ICGT.

[36]  Jirí Adámek.  A Logic of Coequations , 2005, CSL.

[37]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[38]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[39]  Julian Rathke,et al.  Semantic Barbs and Biorthogonality , 2007, FoSSaCS.

[40]  Robin Milner,et al.  Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract) , 2007, EXPRESS.

[41]  Ugo Montanari,et al.  G-Reactive Systems as Coalgebras , 2008, Electron. Notes Theor. Comput. Sci..

[42]  Emilio Tuosto,et al.  Coalgebraic minimization of HD-automata for the Pi-calculus using polymorphic types , 2005, Theor. Comput. Sci..

[43]  Pawel Sobocinski,et al.  Adhesive and quasiadhesive categories , 2005, RAIRO Theor. Informatics Appl..

[44]  Joost Engelfriet,et al.  Multisets and Structural Congruence of the pi-Calculus with Replication , 1999, Theor. Comput. Sci..

[45]  Peter Sewell,et al.  From Rewrite to Bisimulation Congruences , 1998, CONCUR.

[46]  James J. Leifer,et al.  Operational congruences for reactive systems , 2001 .

[47]  Fabio Gadducci,et al.  An inductive view of graph transformation , 1997, WADT.

[48]  Marco Pistore,et al.  Finite State Verification for the Asynchronous pi-Calculus , 1999, TACAS.

[49]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[50]  Philippa Gardner,et al.  Explicit fusions , 2000, Theor. Comput. Sci..

[51]  Robin Milner,et al.  Bigraphs and transitions , 2003, POPL '03.

[52]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[53]  Furio Honsell,et al.  RPO, Second-Order Contexts, and lambda-Calculus , 2008, FoSSaCS.

[54]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[55]  Pierre America,et al.  ECOOP'91 European Conference on Object-Oriented Programming , 1991, Lecture Notes in Computer Science.

[56]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

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

[58]  Giorgio Levi,et al.  Declarative Modeling of the Operational Behavior of Logic Languages , 1989, Theor. Comput. Sci..

[59]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[60]  Julian Bradfield.  CONCUR '96: Concurrency Theory , 1996 .

[61]  Robin Milner,et al.  Bigraphs for Petri Nets , 2003, Lectures on Concurrency and Petri Nets.

[62]  Wan Fokkink,et al.  Ntyft/Ntyxt Rules Reduce to Ntree Rules , 1996, Inf. Comput..

[63]  Reiko Heckel,et al.  A Coalgebraic presentation of structured transition systems , 2001, Theor. Comput. Sci..

[64]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[65]  Davide Sangiorgi,et al.  A theory of bisimulation for the π-calculus , 2009, Acta Informatica.

[66]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[67]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[68]  Furio Honsell,et al.  RPO, Second-order Contexts, and Lambda-calculus , 2008, Log. Methods Comput. Sci..

[69]  Fabio Gadducci,et al.  Term Graph Rewriting for the pi-Calculus , 2003, APLAS.

[70]  Ugo Montanari,et al.  Dynamic congruence vs. progressing bisimulation for CCS , 1992, Fundam. Informaticae.

[71]  Rocco De Nicola,et al.  A Symbolic Semantics for the pi-Calculus , 1996, Inf. Comput..

[72]  Ekkart Kindler,et al.  A Compositional Partial Order Semantics for Petri Net Components , 1997, ICATPN.

[73]  Reiko Heckel,et al.  Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets , 2007, CALCO.

[74]  Fabio Gadducci,et al.  An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories , 1999, Appl. Categorical Struct..

[75]  Roberto Bruni,et al.  Observational congruences for dynamically reconfigurable tile systems , 2005, Theor. Comput. Sci..

[76]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[77]  C.-H. Luke Ong,et al.  Full Abstraction in the Lazy Lambda Calculus , 1993, Inf. Comput..

[78]  Antonio Brogi,et al.  Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study , 2008, Petri Nets.

[79]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[80]  Hartmut Ehrig,et al.  Composition and Decomposition of DPO Transformations with Borrowed Context , 2006, ICGT.

[81]  Vladimiro Sassone,et al.  Reactive systems over cospans , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[82]  Pawel Sobocinski.  Deriving process congruences from reaction rules , 2004 .

[83]  Francesco Zappa Nardelli,et al.  Bisimulation Proof Methods for Mobile Ambients , 2003, ICALP.

[84]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[85]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[86]  Jirí Adámek,et al.  On the Greatest Fixed Point of a Set Functor , 1995, Theor. Comput. Sci..

[87]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[88]  Jan J. M. M. Rutten.  Processes as Terms: Non-Well-Founded Models for Bisimulation , 1992, Math. Struct. Comput. Sci..

[89]  Davide Sangiorgi,et al.  A Theory of Bisimulation for the pi-Calculus , 1993, CONCUR.

[90]  G. Plotkin,et al.  Proof, language, and interaction: essays in honour of Robin Milner , 2000 .

[91]  Ugo Montanari,et al.  Coalgebraic Models for Reactive Systems , 2007, CONCUR.

[92]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[93]  Ugo Montanari,et al.  A Coalgebraic Theory of Reactive Systems , 2008, Electron. Notes Theor. Comput. Sci..

[94]  F. W. Lawvere,et al.  Some algebraic problems in the context of functorial semantics of algebraic theories , 1968 .

[95]  Fabio Gadducci,et al.  Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes , 2005, Processes, Terms and Cycles.

[96]  I. Stark,et al.  A fully abstract domain model for the /spl pi/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[97]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[98]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[99]  Vladimiro Sassone,et al.  Labels from Reductions: Towards a General Theory , 2005, CALCO.

[100]  Ugo Montanari,et al.  Symbolic Semantics Revisited , 2008, FoSSaCS.

[101]  Reiko Heckel,et al.  Tile Transition Systems as Structured Coalgebras , 1999, FCT.

[102]  Ugo Montanari,et al.  Saturated Semantics for Reactive Systems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[103]  J. Benabou.  Introduction to bicategories , 1967 .

[104]  Reiko Heckel,et al.  From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence , 1999, CMCS.

[105]  Marino Miculan,et al.  Reactive Systems over Directed Bigraphs , 2007, CONCUR.

[106]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[107]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[108]  Emilio Tuosto,et al.  Modelling Fusion Calculus using HD-Automata , 2005, CALCO.

[109]  Marco Pistore,et al.  A Partition Refinement Algorithm for the -Calculus , 2001, Inf. Comput..

[110]  Reiko Heckel,et al.  Structured Transition Systems as Lax Coalgebras , 1998, CMCS.

[111]  Wolfgang Reisig,et al.  An Operating Guideline Approach to the SOA , 2005 .

[112]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[113]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[114]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[115]  Robin Milner,et al.  Pure bigraphs: Structure and dynamics , 2006, Inf. Comput..

[116]  Vladimiro Sassone,et al.  Locating reaction with 2-categories , 2005, Theor. Comput. Sci..

[117]  Marino Miculan,et al.  A Unifying Model of Variables and Names , 2005, FoSSaCS.

[118]  A Di Pisa,et al.  Compositional Semantics for Open Petri Nets based on Deterministic Processes , 2001 .

[119]  Lawrence S. Moss,et al.  Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[120]  Fabio Gadducci,et al.  The tile model , 2000, Proof, Language, and Interaction.

[121]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[122]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.