Search results for "CONCUR"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Rob J. van Glabbeek	The Linear Time - Branching Time Spectrum II.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Vasco Thudichum Vasconcelos, Kohei Honda 0001	Principal Typing Schemes in a Polyadic pi-Calculus.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Vladimiro Sassone, Mogens Nielsen, Glynn Winskel	A Classification of Models for Concurrency.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Matthew Hennessy, Huimin Lin	Proof Systems for Message-Passing Process Algebras.	CONCUR	1993	DBLP DOI BibTeX RDF
1	K. V. S. Prasad	Programming with Broadcasts.	CONCUR	1993	DBLP DOI BibTeX RDF	CR classification F3. 2 Semantics of Programming Languages-operational semantics, algebraic approaches to semantics
1	Jos C. M. Baeten, Jan A. Bergstra	Non Interleaving Process Algebra.	CONCUR	1993	DBLP DOI BibTeX RDF	non-interleaving, Petri net, interleaving, true concurrency, ACP, & Phrases process algebra
1	Robert Kim Yates	Networks of Real-Time Processes.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Eike Best (eds.)	CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings	CONCUR	1993	DBLP DOI BibTeX RDF
1	Bart Vergauwen, Johan Lewi	A Linear Local Model Checking Algorithm for CTL.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Eric Goubault	Domains of Higher-Dimensional Automata.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Roberto M. Amadio	On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Kohei Honda 0001	Types for Dyadic Interaction.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Wan J. Fokkink	An Elimination Theorem for Regular Behaviours with Integration.	CONCUR	1993	DBLP DOI BibTeX RDF	& Phrases ACP, relative time, regular process, Elimination Theorem, integration
1	Ole Høgh Jensen, Jarl Tuxen Lang, Christian Jeppesen, Kim Guldstrand Larsen	Model Construction for Implicit Specifications in Model Logic.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Joost Engelfriet	A Multiset Semantics for the pi-Calculus with Replication.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Rob T. Udink, Joost N. Kok	Two Fully Abstract Models for UNITY.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Cliff B. Jones	A pi-Calculus Semantics for an Object-Based Design Notation.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Marija Cubric, Prakash Panangaden	Minimal Memory Schedules for Dataflow Networks.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Davide Sangiorgi	A Theory of Bisimulation for the pi-Calculus.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Bard Bloom	Structured Operational Sematics for Process Algebras and Equational Axiom Systems.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Gérard Boudol	The Lambda-Calculus with Multiplicities (Abstract).	CONCUR	1993	DBLP DOI BibTeX RDF
1	Jos C. M. Baeten, Chris Verhoef	A Congruence Theorem for Structured Operational Semantics with Predicates.	CONCUR	1993	DBLP DOI BibTeX RDF	CR Categories D.3.1, F.1.1, F.4.3, F.3.2
1	Luca Aceto, David Murphy	On the Ill-Timed but Well-Caused.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Jeremy Gunawardena	A Generalized Event Structure for the Muller Unfolding of a Safe Net.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Flemming Nielson, Hanne Riis Nielson	From CML to Process Algebras (Extended Abstract).	CONCUR	1993	DBLP DOI BibTeX RDF
1	Pierre Wolper, Patrice Godefroid	Partial-Order Methods for Temporal Verification.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Roberto Segala	Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract).	CONCUR	1993	DBLP DOI BibTeX RDF
1	Søren Christensen, Yoram Hirshfeld, Faron Moller	Bisimulation Equivalence is Decidable for Basic Parallel Processes.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Orna Bernholtz, Orna Grumberg	Branching Time Temporal Logic and Amorphous Tree Automata.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Shengzong Zhou, Rob Gerth, Ruurd Kuiper 0001	Transformations Preserving Properties and Properties Preserved by Transformations in Fair Transition Systems (Extended Abstract).	CONCUR	1993	DBLP DOI BibTeX RDF
1	Michael J. Butler	Refinement and Decomposition of Value-Passing Action Systems.	CONCUR	1993	DBLP DOI BibTeX RDF
1	Jos C. M. Baeten, Jan A. Bergstra, Scott A. Smolka	Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF
1	Frits W. Vaandrager, Nancy A. Lynch	Action Transducers and Timed Automata.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Søren Christensen, Hans Hüttel, Colin Stirling	Bisimulation Equivalence is Decidable for all Context-Free Processes.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, David L. Dill, Howard Wong-Toi	Minimization of Timed Transition Systems.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Olaf Burkart, Bernhard Steffen	Model Checking for Context-Free Processes.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Michele Boreale, Rocco De Nicola	Testing Equivalence for Mobile Processes (Extended Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF
1	Frank A. Stomp	Preserving Specific Properties in Programm Development: How to Debug Programs (Conference Version).	CONCUR	1992	DBLP DOI BibTeX RDF
1	Rance Cleaveland (eds.)	CONCUR '92, Third International Conference on Concurrency Theory, Stony Brook, NY, USA, August 24-27, 1992, Proceedings	CONCUR	1992	DBLP DOI BibTeX RDF
1	Ed Brinksma	On the Uniqueness of Fixpoints Modulo Observation Congruence.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Butler W. Lampson, Nancy A. Lynch, Jørgen F. Søgaard-Andersen	At-Most-Once Message Delivery. A Case Study in Algorithm Verification.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Kim Guldstrand Larsen, Arne Skou	Compositional Verification of Probabilistic Processes.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn	A Theory of Process with Localities (Extended Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF
1	Gul Agha, Ian A. Mason, Scott F. Smith 0001, Carolyn L. Talcott	Towards a Theory of Actor Computation.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Steven M. German	Programming in a General Model of Synchronization.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Lalita Jategaonkar, Albert R. Meyer	Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Jan Friso Groote, Faron Moller	Verification of Parallel Systems via Decomposition.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Jim Davies, Steve A. Schneider	Using CSP to Verify a Timed Protocol over a Fair Medium.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Jos C. M. Baeten, Jan A. Bergstra	Discrete Time Process Algebra.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Éric Badouel, Philippe Darondeau	Structural Operational Specifications and the Trace Automata.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Steven Klusener	The Silent Step in Time.	CONCUR	1992	DBLP DOI BibTeX RDF	& Phrases Real Time Process Algebra, Abstraction, ACP
1	Arend Rensink	Posets for Configurations!	CONCUR	1992	DBLP DOI BibTeX RDF
1	Günter Karjoth	Implementing LOTOS Specifications by Communicating State Machines.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Ursula Goltz, Ruurd Kuiper 0001, Wojciech Penczek	Propositional Temporal Logics and Equivalences.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Alexander Moshe Rabinovich	Logic of Trace Languages (Extended Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF
1	Matthew Hennessy	Concurrent Testing of Processes (Extended Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF
1	Rob Gerth, Ruurd Kuiper 0001, John Segers	Interface Refinement in Reactive Systems (Extended Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF	interface change, leads to property, ?-automata, concurrency, temporal logic, refinement, transition systems
1	Roope Kaivola, Antti Valmari	The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Robin Milner	The Polyadic Pi-calculus (Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF
1	Doron A. Peled	Sometimes 'Some' is as Good as 'All'.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Davide Sangiorgi, Robin Milner	The Problem of "Weak Bisimulation up to".	CONCUR	1992	DBLP DOI BibTeX RDF
1	Joachim Parrow, Peter Sjödin	Multiway Synchronization Verified with Coupled Simulation.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Henri B. Weinberg, Lenore D. Zuck	Timed Ethernet: Real-Time Formal Specification of Ethernet.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Søren Christensen	Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Amir Pnueli	How Vital is Liveness? Verifying Timing Properties of Reactive and Hybrid Systems (Extended Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF	discrete and continuous systems, Real-time, fairness, hybrid systems, Statecharts, Liveness, timed transitions system, justice
1	Vaughan R. Pratt	The Duality of TIme and Information.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Nick Reingold, Da-Wei Wang, Lenore D. Zuck	Games I/O Automata Play (Extended Abstract).	CONCUR	1992	DBLP DOI BibTeX RDF
1	Florence Maraninchi	Operational and Compositional Semantics of Synchronous Automaton Compositions.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Ehud Shapiro	Embeddings Among Concurrent Programming Languages (Preliminary Version).	CONCUR	1992	DBLP DOI BibTeX RDF
1	Eric Goubault, Thomas P. Jensen	Homology of Higher Dimensional Automata.	CONCUR	1992	DBLP DOI BibTeX RDF
1	José Meseguer 0001, Ugo Montanari, Vladimiro Sassone	On the Semantics of Petri Nets.	CONCUR	1992	DBLP DOI BibTeX RDF
1	Javier Esparza, Manuel Silva Suárez	Compositional Synthesis of Live and Bounded Free Choice Petri Nets.	CONCUR	1991	DBLP DOI BibTeX RDF	Free Choice nets, compositional synthesis, Petri nets, liveness, boundedness
1	Jos C. M. Baeten, Jan Friso Groote (eds.)	CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, Proceedings	CONCUR	1991	DBLP DOI BibTeX RDF
1	Paul Spruit, Roel J. Wieringa	Some Finite-Graph Models for Process Algebra.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Amar Bouali, Robert de Simone	Causal Models for Rational Algebraic Processes.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Faron Moller, Chris M. N. Tofts	Relating Processes With Respect to Speed.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Ketil Stølen	A Method for the Development of Totally Correct Shared-State Parallel Programs.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Rocco De Nicola	Action and State-based Logics for Process Algebras.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Juanito Camilleri	A Conditional Operator for CCS.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Orna Grumberg, David E. Long	Model Checking and Modular Verification.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Jeremy Gunawardena	Geometric Logic, Causality and Event Structures.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Doris Nolte, Lutz Priese	Fairness in Models with True Concurrency.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Padmanabhan Krishnan	Distributed CCS.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Jean-Claude Fernandez, Laurent Mounier	A Tool Set for deciding Behavioral Equivalences.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Huajun Quin	Efficient Verification of Determinate Processes.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Antti Valmari, Matthew Clegg	Reduced Labelled Transition Systems Save Verification Effort.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Ursula Goltz	Causality Based Models for the Design of Concurrent Systems.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Kenneth J. Goldman	A Compositional Model for Layered Distributed Systems.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten	The Failure of Failures in a Paradigm for Asynchronous Communication.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Luca Aceto, Anna Ingólfsdóttir	A Theory of Testing for ACP.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Bengt Jonsson 0001	Simulations Between Specifications of Distributed Systems.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Gian-Luigi Ferrari 0002, Ugo Montanari	The Observation Algebra of Spatial Pomsets.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Wil Janssen, Mannes Poel, Job Zwiers	Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Frank S. de Boer, Catuscia Palamidessi	Embedding as a Tool for Language Comparison: On the CSP Hierarchy.	CONCUR	1991	DBLP DOI BibTeX RDF	concurrent logic languages, embedding, compositional semantics
1	Jean-Marie Jacquet, Luís Monteiro	Extended Horn Clauses: The Framework and Some Semantics.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Nissim Francez, Ira R. Forman	Synchrony Loosening Transformations for Interacting Processes.	CONCUR	1991	DBLP DOI BibTeX RDF
1	Michael Merritt, Francesmary Modugno, Marc R. Tuttle	Time-Constrained Automata (Extended Abstract)	CONCUR	1991	DBLP DOI BibTeX RDF
1	Nicolien J. Drost	Algebraic Formulations of Trace Theory.	CONCUR	1991	DBLP DOI BibTeX RDF	trace models, infinite processes, verification, concurrency, process algebra, alternating bit protocol, complete axiomatization
1	Jos C. M. Baeten, Jan A. Bergstra	Real Space Process Algebra.	CONCUR	1991	DBLP DOI BibTeX RDF	real space-time, Galilei transformation, Lorentz transformation, real time, interleaving, true concurrency, & Phrases process algebra
1	Alan Jeffrey	Abstract Timed Observation and Process Algebra.	CONCUR	1991	DBLP DOI BibTeX RDF

Publications at "CONCUR"( http://dblp.L3S.de/Venues/CONCUR )