, History preserving, causal and mixed-ordering equivalence for stable event structures An algebraic characterization of transition systems equivalences . Information and Computation, 82222:198í229 Proving correctness of CSP programs. A tutorial, Control Flow and Data Flow: Concepts of DistributedP r ogramming, pp.441-474, 1985.
, Theory of traces, Theoretical Computer Science, vol.60, issue.1, pp.1-82, 1988.
DOI : 10.1016/0304-3975(88)90051-5
, On the semantics of concurrency: Partial orders and transition systems, Proc. CAAP'87 ëBC88ë G. Boudol and I. Castellani. Concurrency and atomicity. Theoretical Computer Science, pp.123-13725, 1987.
DOI : 10.1007/3-540-17660-8_52
URL : https://hal.archives-ouvertes.fr/inria-00076004
, Characterizing Kripke structures in temporal logic, Proc. CAAP'87, pp.256-270, 1987.
DOI : 10.1007/3-540-17660-8_60
, Concurrent bisimulations in Petri nets, ëBed87ë M. A. Bednarczyk. Categories of Asynchronous Systems, pp.231-264, 1987.
DOI : 10.1007/BF01178506
, Another look at abstraction in process algebra extended abstractt A theory of communicating sequential processes, Proc. 14th ICALP, pp.84-94560, 1984.
, Bisimulation can't be traced: preliminary report, Proc. 15th ACM Symp. Principles of Programming Languages, pp.229-239, 1988.
, Algebra of communicating processes with abstraction, Proc. 10th ICALP, pp.77-121, 1983.
DOI : 10.1016/0304-3975(85)90088-X
, Ten years of concurrency semantics : selectedp apers of Amsterdam Concurrency Group, W orld Scientiaec, 1992.
DOI : 10.1142/1720
, A logical characterization of observation equivalence, Theoretical Computer Science, vol.35, pp.43-53, 1985.
DOI : 10.1016/0304-3975(85)90004-0
, Design and synthesis of synchronization skeletons using branching time temporal logic, Proc. Logics of Programs Workshop, Yorktown Heights, pp.52-71, 1981.
, Automatic veriaecation of aenite-state concurrent systems using temporal logic speciaecations: A practical approach, Proc. 10th ACM Symp. Principles of Programming Languages, pp.117-126, 1983.
, Back and forth bisimulations on prime event structures, Proc. PARLE'92, pp.843-858, 1992.
DOI : 10.1007/3-540-55599-4_128
, Contributions al aS emantique du Parall elisme: Bisimulations pour le Raaenement et le Vrai Parall elisme, 1992.
, Investigations of back and forth bisimulations on prime event structures 11155:481í496, 1992. ëCle90ë R. Cleaveland. On automatically explaining bisimulation inequivalence, Proc. CAV'90 ëCLP92ë F. Cherief, F. Laroussinie, and S. Pinchinat. Modal logics with past for true concurrency .I n ternal Report, 1990.
, Concurrency vs interleaving: an instructive example, ëDam90ë M. Dam. Translating CTL into the modal -calculus. Research Report ECS-LFCS- 90-123, Lab. for Foundations of Computer Science, pp.12-15, 1987.
, Causal trees, Proc. 16th ICALP, Stresa, pp.234-248, 1989.
, Reaenement of actions in event structures and causal trees, 1992.
, Observational equivalences for concurrency models, Formal Description of Programming Concepts -III, Proc. of the third IFIP WG 2.1 working conf, pp.105-129, 1986.
, Partial orderings descriptions and observations of nondeterministic concurrent processes Branching Time and Partial Order in Logics and Models for Concurrency, Linear Time, 1989.
, Found. of SoftwareT echnology and Theor An operational deaenition of action reaenement Back and forth bisimulations, Proc. 10th Conf Proc. CONCUR'90 Proc. 5th IEEE Symp. Logic in Computer Science, pp.301-315, 1990.
, Characterizing correctness properties of parallel programs using aexpoints ëSometimes" and ëNot Never" revisited: On branching versus linear time temporal logic Temporal and modal logic, Proc. 7th ICALP Journal of Computer and System Sciences, pp.169-181151, 1979.
, The declarative past and imperative future, Proc. Temporal Logic in Speciaecation Proc. Math. Found. Comp. Sci., Porabka-Kozubnik, pp.237-248, 1987.
DOI : 10.1007/3-540-51803-7_36
, Reaenement of actions in causality based models, Stepwise Reaenement of Distributed Systems. Models, Formalisms, Correctness, Mook, pp.267-300, 1989.
, Propositional temporal logics and equivalences, Proc. CONCUR'92, pp.222-236, 1992.
DOI : 10.1007/BFb0084794
, Comparative Concurrency Semantics and Reaenement of Actions The linear time -branching time spectrum, 1990.
, The reaenement theorem for ST-bisimulation semantics Research Report CS-R9002, CWI, pp.427-498, 1981.
, Transition system speciaecations with negative premisses Petri net models for algebraic theories of concurrency.I nProc, Proc. CON- CUR'90, pp.224-242, 1987.
, Structured operational semantics and bisimulation as a congruence, 1988.
DOI : 10.1016/0890-5401(92)90013-6
URL : http://doi.org/10.1016/0890-5401(92)90013-6
, Modular speciaecations in process algebra, Proc. 9th IFIP WG 6.1 Int. Symp. Protocol Speciaecation, Testing and Veriaecation, 1989.
, Structured operational semantics and bisimulation as a congruence, Information and Computation, vol.100022, pp.202-260, 1992.
, Branching time and abstraction in process algebra Reaenement in branching time semantics, Information Processing 89, Proc. IFIP 11th World Computer Congress Proc. AMAST Conf., Iowa City, pp.613-618, 1989.
, Equivalence in PDL and LL.I nProc, pp.46-56, 1987.
, On observing nondeterminism and concurrency.I nProc Algebraic laws for nondeterminism and concurrency Communicating Sequential Processes The power of the future perfect in program logics Fundamentals of model theory, 7th ICALP Handbook of Mathematical Logic, pp.137-16123, 1976.
, Bisimulation Semantics. Lectures given at the REX SchoolèWorkshop, Theoretical Computer Science, pp.27733333-354, 1983.
, A model checker for partial order temporal logic, EE PUB, vol.597, 1986.
, Interleaving set temporal logic What good is temporal logic ? A modal logic for a subclass of event structures, Proc. 6th ACM Symp. Principles of Distributed Computing Proc. 7th ACM Symp. Principles of Programming Languages Proc. Information Processing IFIPP 83 Proc. 14th ICALP ëMil80ë R. Milner. A Calculus of Communicating Systems,v olume 92 of Lecture Notes in Computer Science Proc. CAAP'81, pp.178-190, 1980.
, Operational and Algebraic Semantics of Concurrent Processes, Lab. for Foundations of Computer Science, 1988.
DOI : 10.1016/B978-0-444-88074-1.50024-X
, A complete axiomatisation for observational congruence of aenite-state behaviours. Information and Computation, pp.227-247, 1989.
, Denotational semantics The Temporal Logic of Reactive and Concurent Systems, volume I: Speciaecation, Handbook of Theoretical Computer Science, vol.B, issue.11, pp.575-631, 1989.
, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.
DOI : 10.1016/0304-3975(81)90112-2
URL : http://doi.org/10.1016/0304-3975(81)90112-2
, Specification-oriented semantics for Communicating Processes, Acta Informatica, vol.16, issue.1, pp.9-66, 1986.
DOI : 10.1007/BF00268075
, Concurrency and automata on inaenite sequences, Proc. 5th GI Conf. on Th. Comp. Sci, pp.167-183, 1981.
DOI : 10.1007/bfb0017309
, A Temporal Logic for Event Structures, Fundamenta Informaticae, vol.11133, pp.297-326, 1988.
DOI : 10.1007/978-1-4613-0609-2_23
, A concurrent branching time temporal logic Branching time and partial order in temporal logics, Proc. 3rd Workshop on Computer ScienceL ogic, pp.337-354, 1989.
, Ordinal processes in comparative concurrency semantics, Proc. 5th Workshop on Computer ScienceL ogic ëPin92ë S. Pinchinat. Ordinal processes in comparative concurrency semantics, pp.293-305, 1991.
DOI : 10.1007/BFb0023775
, A structural approach to operational semantics The temporal logic of programs Linear and branching structures in the semantics and logics of reactive systems, Proc. 18th IEEE Symp Proc. 12th ICALP, Nafplion ëPra76ë V. R. Pratt. Semantical considerations on Floyd-Hoare logic Proc. 17th IEEE Symp. Foundations of Computer Science, pp.46-57, 1976.
, A decidable mu-calculus: Preliminary report, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), pp.421-427, 1981.
DOI : 10.1109/SFCS.1981.4
, Modeling concurrency with partial orders, International Journal of Parallel Programming, vol.25, issue.49, pp.33-71, 1986.
DOI : 10.1007/BF01379149
, A temporal logic for reasoning about partially ordered computations extended abstractt, Proc. 3rdA CM Symp. Principles of Distributed Computing, pp.28-37, 1984.
, Fairness and related properties in transition systems ? a temporal logic to deal with fairness, Acta Informatica, vol.19, issue.3, pp.195-220357, 1982.
DOI : 10.1007/BF00265555
, Proof Techniques for CCS Available as Report CST-19-82. ëSB69ë D. Scott and J. W. de Bakker. A theory of programs, IBM Seminar CWI, 1969.
, Congruence properties of the process equivalence induced by temporal logic, Research Report, vol.831, 1990.
, S emantique du parall elisme et logique temporelle, 1990.
, Property preserving homomorphisms of transition systems Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245í267, 1985. ëSin90ë A. Sinachopoulos. Partial order logics for elementary net systems: State-and eventapproaches, Proc. Logics of Programs Workshop Proc. CONCUR'90 ëSP90ë Ph. Schnoebelen and S. Pinchinat. On the weak adequacy of branching-time temporal logic Proc. ESOP'90, pp.377-388, 1983.
, Propositional dynamic logic of looping and converse Theory of Computing, Milwaukee, pages 375í383, 1981. ëTar55ë A. Tarski. A lattice-theoretical aexpoint theorem and its applications, Proc. 13th ACM Symp, pp.285-309, 1955.
, An explicit representation of equivalence classes of the history preserving bisimulation. Unpublished manuscript, CWI-Amsterdam, 1989.
, Algebraic Techniques for Concurrency and their Applications, 1989.
, Bisimulation and action reaenement SFB-Bericht 342è10è90 Bisimulation and action reaenement, Institut fí ur Informatik Proc. STACS'91, pp.309-321, 1990.
DOI : 10.1016/0304-3975(93)90157-o
URL : http://doi.org/10.1016/0304-3975(93)90157-o
, Synchrony and Asynchrony in Process Algebra An introduction to event structures Branching Time and Partial Order in Logics and Models for Concurrency Models for concurrency, Proc. 3rd IEEE Symp Linear Time, 1988.