Process algebra with action dependencies

[1]  Ursula Goltz,et al.  Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.

[2]  Elie Najm,et al.  Formal Description Techniques and Protocol Specification, Testing and Verification , 1998, IFIP — The International Federation for Information Processing.

[3]  Arend Rensink,et al.  An Algebraic Semantics for Message Sequence Chart Documents , 1998, FORTE.

[4]  Wan Fokkink,et al.  A Conservative Look at Operational Semantics with Variable Binding , 1998, Inf. Comput..

[5]  Arend Rensink,et al.  Bisimilarity of open terms , 1999, EXPRESS.

[6]  Arend Rensink,et al.  Dependency-Based Action Refinement , 1997, MFCS.

[7]  Gerard J. Holzmann,et al.  Partial Order Methods in Verification , 1997 .

[8]  Michaela Huhn.  On the hierarchical design of distributed systems , 1997 .

[9]  Michel A. Reniers,et al.  High-level message sequence charts , 1997, SDL Forum.

[10]  Glynn Winskel,et al.  Models for Concurrency: Towards a Classification , 1996, Theor. Comput. Sci..

[11]  Michaela Huhn,et al.  Action Refinement and Property Inheritance in Systems of Sequential Agents , 1996, CONCUR.

[12]  Rob J. van Glabbeek,et al.  The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..

[13]  Arend Rensink,et al.  Comparing Syntactic and Semantic Sction Refinement , 1996, Inf. Comput..

[14]  Jan Friso Groote,et al.  The meaning of negative premises in transition system specifications , 1991, JACM.

[15]  Ugo Montanari,et al.  CONCUR '96: Concurrency Theory , 1996, Lecture Notes in Computer Science.

[16]  Roberto Gorrieri,et al.  A Causal Operational Semantics of Action Refinement , 1995, Inf. Comput..

[17]  Paul Gastin,et al.  A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract) , 1995, ICALP.

[18]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[19]  Wojciech Zielonka,et al.  The Book of Traces , 1995 .

[20]  Arend Rensink.  An Event-Based SOS for a Language with Refinement , 1995, STRICT.

[21]  Arend Rensink,et al.  Weak Sequential Composition in Process Algebras , 1994, CONCUR.

[22]  Heike Wehrheim.  Parametric Action Refinement , 1994, PROCOMET.

[23]  Roberto Gorrieri,et al.  Axiomatising ST-Bisimulation Equivalence , 1994, PROCOMET.

[24]  Arend Rensink,et al.  Methodological Aspects of Action Refinement , 1994, PROCOMET.

[25]  Heike Wehrheima.  Parametric Action Reenement , 1994 .

[26]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[27]  Philippe Darondeau,et al.  Refinement of Actions in Event Structures and Causal Trees , 1993, Theor. Comput. Sci..

[28]  Mannes Poel,et al.  Modular Completeness for Communication Closed Layers , 1993, CONCUR.

[29]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[30]  Volker Diekert.  On the Concentration of Infinite Traces , 1993, Theor. Comput. Sci..

[31]  Raymond R. Devillers,et al.  General Refinement and Recursion Operators for the Petri Box Calculus , 1993, STACS.

[32]  Walter Vogler,et al.  Bisimulation and Action Refinement , 1991, Theor. Comput. Sci..

[33]  Frits W. Vaandrager,et al.  Expressiveness results for process algebras , 1993 .

[34]  Arend Rensink.  Models and Methods for Action Refinement , 1993 .

[35]  Job Zwiers,et al.  From sequential layers to distributed processes: deriving a distributed minimum weight spanning tree algorithm , 1992, PODC '92.

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

[37]  Robin Milner,et al.  The Problem of "Weak Bisimulation up to" , 1992, CONCUR.

[38]  Arend Rensink.  Posets for Configurations! , 1992, CONCUR.

[39]  Albert R. Meyer,et al.  Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report , 1992, CONCUR.

[40]  Frits W. Vaandrager,et al.  Turning SOS rules into equations , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[41]  Roberto Gorrieri,et al.  A Categorial View of Process Refinement , 1992, REX Workshop.

[42]  Frits W. Vaandrager,et al.  Expressive Results for Process Algebras , 1992, REX Workshop.

[43]  Job Zwiers,et al.  Protocol Design by Layered Decomposition: A Compositional Approach , 1992, FTRTFT.

[44]  Wim H. Hesselink,et al.  Semantics: Foundations and Applications , 1992, Lecture Notes in Computer Science.

[45]  CONCUR '92 , 1992, Lecture Notes in Computer Science.

[46]  Mannes Poel,et al.  Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach , 1991, CONCUR.

[47]  Job Zwiers.  Layering and Action Refinement for Timed Systems , 1991, REX Workshop.

[48]  Mary Jane Phillips-Matz,et al.  Traces , 1991 .

[49]  Luca Aceto,et al.  Adding Action Refinement to a Finite Process Algebra , 1991, Inf. Comput..

[50]  Philippe Darondeau,et al.  On Guarded Recursion , 1991, Theor. Comput. Sci..

[51]  Bengt Jonsson,et al.  Refining Interfaces of Communicating Systems , 1991, TAPSOFT, Vol.2.

[52]  Rita Loogen,et al.  Modelling nondeterministic concurrent processes with event structures , 1991, Fundam. Informaticae.

[53]  Rocco De Nicola,et al.  A Partial Ordering Semantics for CCS , 1990, Theor. Comput. Sci..

[54]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.

[55]  Luca Aceto,et al.  Towards action-refinement in process algebras , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

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

[57]  J. Klop,et al.  J.W. de Bakker, 25 jaar semantiek : liber amicorum , 1989 .

[58]  Antoni W. Mazurkiewicz,et al.  Basic notions of trace theory , 1988, REX Workshop.

[59]  Kim S. Larsen,et al.  Fully abstract models for a process language with refinement , 1988, REX Workshop.

[60]  Glynn Winskel,et al.  An introduction to event structures , 1988, REX Workshop.

[61]  Haim Gaifman,et al.  Modeling concurrency by partial orders and nonlinear transition systems , 1988, REX Workshop.

[62]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

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

[64]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[65]  Jcm Jos Baeten,et al.  Abstraction and empty process in process algebra , 1987 .

[66]  Iso. Lotos,et al.  A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour , 1985 .

[67]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

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

[69]  Antoni W. Mazurkiewicz,et al.  Traces, Histories, Graphs: Instances of a Process Monoid , 1984, International Symposium on Mathematical Foundations of Computer Science.

[70]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[71]  Nissim Francez,et al.  Decomposition of Distributed Programs into Communication-Closed Layers , 1982, Sci. Comput. Program..

[72]  J. W. de Bakker,et al.  Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..

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

[74]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .