Search results for "P-bisimilarity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
132	Petr Jancar, Jirí Srba	Undecidability of bisimilarity by defender's forcing.	J. ACM	2008	DBLP DOI BibTeX RDF	process algebra, undecidability, pushdown automata, Bisimilarity
109	Marcin Jurdzinski, Mogens Nielsen	Hereditary History Preserving Bisimilarity Is Undecidable.	STACS	2000	DBLP DOI BibTeX RDF
80	Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux	Comparison of the Expressiveness of Timed Automata and Time Petri Nets.	FORMATS	2005	DBLP DOI BibTeX RDF	Timed Language, Timed Bisimilarity, Timed Automata, Expressiveness, Time Petri Nets
79	Ivan Lanese, Jorge A. Pérez 0001, Davide Sangiorgi, Alan Schmitt	On the Expressiveness and Decidability of Higher-Order Process Calculi.	LICS	2008	DBLP DOI BibTeX RDF	behavioral equivalences, decidability, expressiveness, process calculi, higher-order languages
75	Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell 0001	An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.	FoSSaCS	2003	DBLP DOI BibTeX RDF
69	Allan Cheng, Mogens Nielsen	Open Maps, Behavioural Equivalences, and Congruences.	CAAP	1996	DBLP DOI BibTeX RDF	Open maps, P-bisimilarity, P-factorisability, process algebra, category theory, congruences
68	Xian Xu 0001	Expressing First-Order pi-Calculus in Higher-Order Calculus of Communicating Systems.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	encoding, bisimulation, full abstraction, process calculus, higher order
68	Søren B. Lassen	Eager Normal Form Bisimulation.	LICS	2005	DBLP DOI BibTeX RDF
64	Ernst-Rüdiger Olderog	Strong bisimilarity on nets: a new concept for comparing net semantics.	REX Workshop	1988	DBLP DOI BibTeX RDF	Strong bisimilarity, labelled place/transitions nets, causal nets, process terms, COSY, operational and compositional net semantics, CSP, CCS, safeness
63	Haiyan Chen	More on Weak Bisimilarity of Normed Basic Parallel Processes.	TAMC	2008	DBLP DOI BibTeX RDF
63	Xinxin Liu, Haiyan Chen	Deciding Weak Bisimilarity of Normed Context-Free Processes Using Tableau.	ICTAC	2007	DBLP DOI BibTeX RDF
63	Petr Jancar, Jirí Srba	Undecidability Results for Bisimilarity on Prefix Rewrite Systems.	FoSSaCS	2006	DBLP DOI BibTeX RDF
63	Jirí Srba	Strong bisimilarity of simple process algebras: complexity lower bounds.	Acta Informatica	2003	DBLP DOI BibTeX RDF
58	Bernard Berthomieu, Florent Peres, François Vernadat 0001	Bridging the Gap Between Timed Automata and Bounded Time Petri Nets.	FORMATS	2006	DBLP DOI BibTeX RDF	weak timed bisimilarity, real-time systems modeling and verification, Timed Automata, priorities, Time Petri nets
56	Kristian Støvring, Søren B. Lassen	A complete, co-inductive syntactic theory of sequential control and state.	POPL	2007	DBLP DOI BibTeX RDF	mutable references, continuations, bisimulation
56	Søren B. Lassen	Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus.	LICS	2006	DBLP DOI BibTeX RDF
56	Davide Sangiorgi, David Walker 0008	On Barbed Equivalences in pi-Calculus.	CONCUR	2001	DBLP DOI BibTeX RDF
56	Richard Mayr	On the Complexity of Bisimulation Problems for Basic Parallel Processes.	ICALP	2000	DBLP DOI BibTeX RDF
56	Antonín Kucera 0001	Efficient Verification Algorithms for One-Counter Processes.	ICALP	2000	DBLP DOI BibTeX RDF
56	Jirí Srba	Deadlocking States in Context-Free Process Algebra.	MFCS	1998	DBLP DOI BibTeX RDF
52	Filippo Bonchi, Ugo Montanari	Minimization Algorithm for Symbolic Bisimilarity.	ESOP	2009	DBLP DOI BibTeX RDF
52	Supratik Mukhopadhyay, Andreas Podelski	Constraint Database Models Characterizing Timed Bisimilarity.	PADL	2001	DBLP DOI BibTeX RDF
52	Mingsheng Ying, Martin Wirsing	Approximate Bisimilarity.	AMAST	2000	DBLP DOI BibTeX RDF	Real Time ACP, Process Algebra, Bisimulation
52	Slawomir Lasota 0001	Partial-Congruence Factorization of Bisimilarity Induced by Open Maps.	ICALP	1998	DBLP DOI BibTeX RDF
52	Michele Boreale, Luca Trevisan	Bisimilarity Problems Requiring Exponential Time.	MFCS	1996	DBLP DOI BibTeX RDF
52	Ugo Montanari, Marco Pistore	Checking Bisimilarity for Finitary pi-Calculus.	CONCUR	1995	DBLP DOI BibTeX RDF
46	Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux	Comparison of Different Semantics for Time Petri Nets.	ATVA	2005	DBLP DOI BibTeX RDF	Timed Bisimilarity, Expressiveness, Time Petri Nets
46	Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux	When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?	FSTTCS	2005	DBLP DOI BibTeX RDF	Weak Timed Bisimilarity, Timed Automata, Time Petri Nets
46	Ole Høgh Jensen, Robin Milner	Bigraphs and transitions.	POPL	2003	DBLP DOI BibTeX RDF	bigraph, mobile computation, reactive system, transition system, ?-calculus, bisimilarity
45	Franck van Breugel, Steven Shalit, James Worrell 0001	Testing Labelled Markov Processes.	ICALP	2002	DBLP DOI BibTeX RDF
45	Andrew M. Pitts, Joshua R. X. Ross	Process Calculus Based upon Evaluation to Committed Form.	CONCUR	1996	DBLP DOI BibTeX RDF
45	David Walker 0008	On Bisimulation in the pi-calculus.	CONCUR	1994	DBLP DOI BibTeX RDF
41	Hongfei Fu 0001	Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable.	APLAS	2009	DBLP DOI BibTeX RDF
41	Andrei Popescu 0001	Weak Bisimilarity Coalgebraically.	CALCO	2009	DBLP DOI BibTeX RDF
41	Tomás Brázdil, Antonín Kucera 0001, Oldrich Strazovský	Deciding probabilistic bisimilarity over infinite-state probabilistic systems.	Acta Informatica	2008	DBLP DOI BibTeX RDF
41	Paolo Baldan, Andrea Corradini 0001, Hartmut Ehrig, Reiko Heckel, Barbara König 0001	Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets.	CALCO	2007	DBLP DOI BibTeX RDF
41	Wan J. Fokkink, Jun Pang 0001, Anton Wijs	Is Timed Branching Bisimilarity an Equivalence Indeed?.	FORMATS	2005	DBLP DOI BibTeX RDF
41	Simon Helsen	Bisimilarity for the Region Calculus.	High. Order Symb. Comput.	2004	DBLP DOI BibTeX RDF	region calculus, bisimulation, equational theory, contextual equivalence
41	Tomás Brázdil, Antonín Kucera 0001, Oldrich Strazovský	Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems.	CONCUR	2004	DBLP DOI BibTeX RDF
41	Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir	Equational Axioms for Probabilistic Bisimilarity.	AMAST	2002	DBLP DOI BibTeX RDF
41	Roberto Bruni, David de Frutos-Escrig, Narciso Martí-Oliet, Ugo Montanari	Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic.	CONCUR	2000	DBLP DOI BibTeX RDF
41	Petr Jancar, Faron Moller	Techniques for Decidability and Undecidability of Bisimilarity.	CONCUR	1999	DBLP DOI BibTeX RDF
41	Antonín Kucera 0001, Richard Mayr	Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.	CONCUR	1999	DBLP DOI BibTeX RDF
41	Michele Boreale, Luca Trevisan	On the Complexity of Bisimilarity for Value-Passing Processes (Extended Abstract).	FSTTCS	1995	DBLP DOI BibTeX RDF
41	Walter Vogler	Deciding History Preserving Bisimilarity.	ICALP	1991	DBLP DOI BibTeX RDF
36	Marco Bernardo 0001, Sabina Rossi	Reverse Bisimilarity vs. Forward Bisimilarity.	FoSSaCS	2023	DBLP DOI BibTeX RDF
36	Marco Bernardo 0001, Andrea Esposito 0006	On the Weak Continuation of Reverse Bisimilarity vs. Forward Bisimilarity.	ICTCS	2023	DBLP BibTeX RDF
36	Luca Aceto, Anna Ingólfsdóttir, Joshua Sack	Resource bisimilarity and graded bisimilarity coincide.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
35	Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik	A finite equational base for CCS with left merge and communication merge.	ACM Trans. Comput. Log.	2009	DBLP DOI BibTeX RDF	communication merge, finite equational base, left merge, concurrency, process algebra, CCS, parallel composition, handshaking, Bisimilarity
35	H. M. W. Verbeek, Twan Basten	Deciding Life-Cycle Inheritance on Petri Nets.	ICATPN	2003	DBLP DOI BibTeX RDF	life-cycle inheritance, branching bisimilarity, T-invariants, Petri nets, workflow, Object-orientation, backtracking, structural properties
34	Lorenzo De Nardo, Francesco Ranzato, Francesco Tapparo	The Subgraph Similarity Problem.	IEEE Trans. Knowl. Data Eng.	2009	DBLP DOI BibTeX RDF
34	Konstantinos Chatzikokolakis 0001, Gethin Norman, David Parker 0001	Bisimulation for Demonic Schedulers.	FoSSaCS	2009	DBLP DOI BibTeX RDF
34	Filippo Bonchi, Ugo Montanari	Coalgebraic Symbolic Semantics.	CALCO	2009	DBLP DOI BibTeX RDF
34	Daniel Hirschkoff, Damien Pous	A Distribution Law for CCS and a New Congruence Result for the pi-Calculus.	FoSSaCS	2007	DBLP DOI BibTeX RDF
34	Filippo Bonchi, Ugo Montanari	Coalgebraic Models for Reactive Systems.	CONCUR	2007	DBLP DOI BibTeX RDF
34	Cosimo Laneve, Gianluigi Zavattaro	Foundations of Web Transactions.	FoSSaCS	2005	DBLP DOI BibTeX RDF
34	Robin Milner	Bigraphs for Petri Nets.	Lectures on Concurrency and Petri Nets	2003	DBLP DOI BibTeX RDF
34	Paolo Baldan, Andrea Bracciali, Roberto Bruni	Bisimulation by Unification.	AMAST	2002	DBLP DOI BibTeX RDF
34	Nobuko Yoshida, Kohei Honda 0001, Martin Berger 0001	Linearity and Bisimulation.	FoSSaCS	2002	DBLP DOI BibTeX RDF
34	Jirí Srba	On the Power of Labels in Transition Systems.	CONCUR	2001	DBLP DOI BibTeX RDF
34	Thomas A. Henzinger, Sriram K. Rajamani	Fair Bisimulation.	TACAS	2000	DBLP DOI BibTeX RDF
34	Richard Mayr	On the Complexity of Bisimulation Problems for Pushdown Automata.	IFIP TCS	2000	DBLP DOI BibTeX RDF	verification, complexity, bisimulation, Pushdown automata
34	Yuxi Fu	Open Bisimulations on Chi Processes.	CONCUR	1999	DBLP DOI BibTeX RDF
34	Petr Jancar	Decidability Questions for Bismilarity of Petri Nets and Some Related Problems.	STACS	1994	DBLP DOI BibTeX RDF
29	Antti Valmari	Bisimilarity Minimization in O(m logn) Time.	Petri Nets	2009	DBLP DOI BibTeX RDF	Analysis of reachability graphs, verification of systems
29	Luís Dominguez	Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus.	LICS	2009	DBLP DOI BibTeX RDF
29	Luke Simon	Optimizing Pointer Analysis Using Bisimilarity.	SAS	2009	DBLP DOI BibTeX RDF
29	Lingyun Luo	Deciding Bisimilarity of Full BPA Processes Locally.	ATVA	2008	DBLP DOI BibTeX RDF
29	Petr Jancar	Selected Ideas Used for Decidability and Undecidability of Bisimilarity.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF	decidability, bisimulation equivalence
29	Jirí Srba	Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard.	ICALP	2002	DBLP DOI BibTeX RDF
29	Jirí Srba	Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard.	STACS	2002	DBLP DOI BibTeX RDF
29	Slawomir Lasota 0001	Decidability of Strong Bisimilarity for Timed BPP.	CONCUR	2002	DBLP DOI BibTeX RDF
29	Colin Stirling	Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes.	FoSSaCS	2001	DBLP DOI BibTeX RDF
29	Slawomir Lasota 0001	Weak Bisimilarity and Open Maps.	SOFSEM	1998	DBLP DOI BibTeX RDF
29	Hans Hüttel	Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes.	CAV	1991	DBLP DOI BibTeX RDF
24	Paolo Baldan, Filippo Bonchi, Fabio Gadducci	Encoding Asynchronous Interactions Using Open Petri Nets.	CONCUR	2009	DBLP DOI BibTeX RDF	Asynchronous calculi, open Petri nets, decidability, bisimilarity
24	Farn Wang	Symbolic Simulation-Checking of Dense-Time Automata.	FORMATS	2007	DBLP DOI BibTeX RDF	simulation, model-checking, verification, real-time, refinement, implementation, embedded, events, timed automata, bisimulation, equivalence, bisimilarity, dense-time
24	Alexander Kurz 0001, Jirí Rosický	Weak Factorizations, Fractions and Homotopies.	Appl. Categorical Struct.	2005	DBLP DOI BibTeX RDF	weak factorization system, category of fractions, homotopy, bisimilarity
24	Yoram Hirshfeld, Mark Jerrum, Faron Moller	A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes	FOCS	1994	DBLP DOI BibTeX RDF	normed context-free processes, language equivalence, polynomial-time algorithm, decidability, equivalence, context-free grammars, bisimilarity
23	Davide Sangiorgi	On the origins of bisimulation and coinduction.	ACM Trans. Program. Lang. Syst.	2009	DBLP DOI BibTeX RDF	greatest fixed points, Bisimulation, history, fixed points, coinduction
23	Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani	Howe's Method for Calculi with Passivation.	CONCUR	2009	DBLP DOI BibTeX RDF
23	Guilherme Rangel, Barbara König 0001, Hartmut Ehrig	Deriving Bisimulation Congruences in the Presence of Negative Application Conditions.	FoSSaCS	2008	DBLP DOI BibTeX RDF
23	Pietro Di Gianantonio, Furio Honsell, Marina Lenisa	RPO, Second-Order Contexts, and lambda-Calculus.	FoSSaCS	2008	DBLP DOI BibTeX RDF
23	Maria Grazia Buscemi, Ugo Montanari	Open Bisimulation for the Concurrent Constraint Pi-Calculus.	ESOP	2008	DBLP DOI BibTeX RDF
23	Petr Jancar, Martin Kot, Zdenek Sawa	Normed BPA vs. Normed BPP Revisited.	CONCUR	2008	DBLP DOI BibTeX RDF	Basic Process Algebra, Basic Parallel Processes, verification, equivalence checking, bisimulation equivalence
23	Xiaoju Dong, Yuxi Fu	Barbed Congruence of Asymmetry and Mismatch.	J. Comput. Sci. Technol.	2007	DBLP DOI BibTeX RDF	bisimulation, axiomatization, process calculus
23	Franck van Breugel, Babita Sharma, James Worrell 0001	Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems.	FoSSaCS	2007	DBLP DOI BibTeX RDF
23	Alwen Tiu	A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract.	APLAS	2007	DBLP DOI BibTeX RDF
23	Marco Bernardo 0001	A Survey of Markovian Behavioral Equivalences.	SFM	2007	DBLP DOI BibTeX RDF
23	Barbara König 0001	Deriving Bisimulation Congruences with Borrowed Contexts.	CALCO	2007	DBLP DOI BibTeX RDF
23	Filippo Bonchi, Barbara König 0001, Ugo Montanari	Saturated Semantics for Reactive Systems.	LICS	2006	DBLP DOI BibTeX RDF
23	Marcelo P. Fiore, Sam Staton	A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics.	LICS	2006	DBLP DOI BibTeX RDF
23	Mingsheng Ying	pi-calculus with noisy channels.	Acta Informatica	2005	DBLP DOI BibTeX RDF
23	Damien Pous	Up-to Techniques for Weak Bisimulation.	ICALP	2005	DBLP DOI BibTeX RDF
23	Sibylle B. Fröschle	Composition and Decomposition in True-Concurrency.	FoSSaCS	2005	DBLP DOI BibTeX RDF
23	Mohammad Reza Mousavi 0001, Murdoch Gabbay, Michel A. Reniers	SOS for Higher Order Processes.	CONCUR	2005	DBLP DOI BibTeX RDF	Congruence Rule Formats, Bisimulation, Formal Semantics, Congruence, Structural Operational Semantics
23	Sibylle B. Fröschle, Slawomir Lasota 0001	Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP.	CONCUR	2005	DBLP DOI BibTeX RDF
23	Thomas A. Henzinger, Rupak Majumdar, Vinayak S. Prabhu	Quantifying Similarities Between Timed Systems.	FORMATS	2005	DBLP DOI BibTeX RDF
23	Mohammad Reza Mousavi 0001, Michel A. Reniers, Jan Friso Groote	Congruence for SOS with Data.	LICS	2004	DBLP DOI BibTeX RDF
23	Yuxin Deng, Davide Sangiorgi	Towards an Algebraic Theory of Typed Mobile Processes.	ICALP	2004	DBLP DOI BibTeX RDF