Search results for "trace-equivalence"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
80	Chi-Chang Jou, Scott A. Smolka	Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes.	CONCUR	1990	DBLP DOI BibTeX RDF
52	James C. Corbett, George S. Avrunin	Towards Scalable Compositional Analysis.	SIGSOFT FSE	1994	DBLP DOI BibTeX RDF
47	Stephen D. Brookes, William C. Rounds	Behavioural Equivalence Relations Induced by Programming Logics.	ICALP	1983	DBLP DOI BibTeX RDF
46	Prasanna Thati, Carolyn L. Talcott, Gul Agha	Techniques for Executing and Reasoning about Specification Diagrams.	AMAST	2004	DBLP DOI BibTeX RDF	Graphical specification languages, may testing, trace equivalence, rewriting logic, calculus
46	Irina B. Virbitskaite, Natalya S. Gribovskaja	Open Maps and Trace Semantics for Timed Partial Order Models.	Ershov Memorial Conference	2003	DBLP DOI BibTeX RDF	timed event structures, trace equivalence, Category theory, partial order semantics
38	Jesus F. Sánchez-Blanco, Antonio Ramírez-Treviño, Alejandra Santoyo-Sanchez	Regulation control in interpreted Petri nets using trace equivalence.	SMC (2)	2004	DBLP DOI BibTeX RDF
38	Siamak Nazari, John G. Thistle	Structural Conditions for Model-checking of Parameterized Networks.	ACSD	2007	DBLP DOI BibTeX RDF
37	Chao Wang 0001, Swarat Chaudhuri, Aarti Gupta, Yu Yang 0013	Symbolic pruning of concurrent program executions.	ESEC/SIGSOFT FSE	2009	DBLP DOI BibTeX RDF	concurrency, sat, pruning, partial order reduction
33	Michele Boreale, Rocco De Nicola, Rosario Pugliese	Proof Techniques for Cryptographic Processes.	LICS	1999	DBLP DOI BibTeX RDF	Logical aspects of protocol security, Formal methods, Semantics, Concurrency
33	Luca de Alfaro, Marco Faella, Mariëlle Stoelinga	Linear and Branching System Metrics.	IEEE Trans. Software Eng.	2009	DBLP DOI BibTeX RDF
33	Luca de Alfaro, Marco Faella, Mariëlle Stoelinga	Linear and Branching Metrics for Quantitative Transition Systems.	ICALP	2004	DBLP DOI BibTeX RDF
32	Gang Luo, Gregor von Bochmann, Alexandre Petrenko	Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	communicating nondeterministic finite-state machines, generalized Wp-method, conformance relation, trace-equivalence, deterministic finite-state machines, software engineering, software engineering, protocols, software testing, finite state machines, specification languages, program testing, concurrent programs, communication protocols, fault coverage, conformance testing, programming theory, SDL, reachability analysis, test suites, multiprocessing programs, test selection, protocol engineering, test sequence generation, protocol conformance testing
32	Frits W. Vaandrager	Expressive Results for Process Algebras.	REX Workshop	1992	DBLP DOI BibTeX RDF	process graphs, effective process graphs, effective operational semantics, trace equivalence, action transducers, process algebra, expressiveness, labeled transition systems, PC, structural operational semantics, bisimulation equivalence
28	Josée Desharnais, François Laviolette, Krishna Priya Darsini Moturu, Sami Zhioua	Trace Equivalence Characterization Through Reinforcement Learning.	Canadian AI	2006	DBLP DOI BibTeX RDF
28	Joost Engelfriet	Determinacy - (Observation Equivalence = Trace Equivalence).	Theor. Comput. Sci.	1985	DBLP DOI BibTeX RDF
28	Mila E. Majster-Cederbaum, Jinzhao Wu	Towards action refinement for true concurrent real time.	Acta Informatica	2003	DBLP DOI BibTeX RDF
28	Mila E. Majster-Cederbaum, Jinzhao Wu	Action Refinement for True Concurrent Real Time.	ICECCS	2001	DBLP DOI BibTeX RDF	timed event structure, timed process algebra, action refinement, true concurrency
28	Qing Guo, Paliath Narendran, Sandeep K. Shukla	Unification and Matching in Process Algebras.	RTA	1998	DBLP DOI BibTeX RDF
28	Josée Desharnais, François Laviolette, Sami Zhioua	Testing Probabilistic Equivalence Through Reinforcement Learning.	FSTTCS	2006	DBLP DOI BibTeX RDF
24	Mila E. Majster-Cederbaum, Jinzhao Wu, Houguang Yue	Refinement of actions for real-time concurrent systems with causal ambiguity.	Acta Informatica	2006	DBLP DOI BibTeX RDF	Causal ambiguity, Timed bundle event structure with causal ambiguity, Concurrency, Action refinement
24	Wil M. P. van der Aalst, Ana Karla A. de Medeiros, A. J. M. M. Weijters	Process Equivalence: Comparing Two Process Models Based on Observed Behavior.	Business Process Management	2006	DBLP DOI BibTeX RDF	Process Equivalence, Petri Nets, Process Mining
24	Jianmin Jiang, Jinzhao Wu	The Preservation of Interleaving Equivalences.	ICECCS	2005	DBLP DOI BibTeX RDF	bundle action transitions, interleaving equivalences, action refinement, Event structures
24	Mila E. Majster-Cederbaum, Jinzhao Wu, Houguang Yue, Naijun Zhan	Refinement of Actions for Real-Time Concurrent Systems with Causal Ambiguity.	ICFEM	2004	DBLP DOI BibTeX RDF	causal ambiguity, timed event structure with causal ambiguity, Concurrency, action refinement
24	Jinzhao Wu, Houguang Yue	Towards Action Refinement for Concurrent Systems with Causal Ambiguity.	SEFM	2004	DBLP DOI BibTeX RDF	causal ambiguity, event structures with causal ambiguity, Concurrency, action refinement
24	Luca Durante, Riccardo Sisto, Adriano Valenzano	Automatic testing equivalence verification of spi calculus specifications.	ACM Trans. Softw. Eng. Methodol.	2003	DBLP DOI BibTeX RDF	equivalence verification, Cryptographic protocols, state space exploration
24	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	Fair Equivalence Relations.	Verification: Theory and Practice	2003	DBLP DOI BibTeX RDF
24	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	Fair Equivalence Relations.	FSTTCS	2000	DBLP DOI BibTeX RDF
23	Alexandre Petrenko	Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography.	MOVEP	2000	DBLP DOI BibTeX RDF
19	Ferry Timmers, Jan Friso Groote	A Complete Axiomatisation for Probabilistic Trace Equivalence.	Sci. Ann. Comput. Sci.	2020	DBLP DOI BibTeX RDF
19	Kiraku Minami	Trace Equivalence and Epistemic Logic to Express Security Properties.	FORTE	2020	DBLP DOI BibTeX RDF
19	Honghui He, Jinzhao Wu, Juxia Xiong	Approximate Completed Trace Equivalence of ILAHSs Based on SAS Solving.	Inf.	2019	DBLP DOI BibTeX RDF
19	Kiraku Minami	Trace Equivalence and Epistemic Logic to Express Security Properties.	CoRR	2019	DBLP BibTeX RDF
19	Vivek Nigam, Carolyn L. Talcott, Abraão Aires Urquiza	Symbolic Timed Trace Equivalence.	Foundations of Security, Protocols, and Equational Reasoning	2019	DBLP DOI BibTeX RDF
19	Alexandre Goy 0002, Jurriaan Rot	(In)finite Trace Equivalence of Probabilistic Transition Systems.	CMCS	2018	DBLP DOI BibTeX RDF
19	David Baelde, Stéphanie Delaune, Lucca Hirschi	A Reduced Semantics for Deciding Trace Equivalence.	CoRR	2017	DBLP BibTeX RDF
19	Gaoang Bian, Alessandro Abate	On the Relationship between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context (Extended Version).	CoRR	2017	DBLP BibTeX RDF
19	David Baelde, Stéphanie Delaune, Lucca Hirschi	A Reduced Semantics for Deciding Trace Equivalence.	Log. Methods Comput. Sci.	2017	DBLP DOI BibTeX RDF
19	Gaoang Bian, Alessandro Abate	On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context.	FoSSaCS	2017	DBLP DOI BibTeX RDF
19	Mustafa Jarrar, Anton Deik	The Graph Signature: A Scalable Query Optimization Index for RDF Graph Databases Using Bisimulation and Trace Equivalence Summarization.	Int. J. Semantic Web Inf. Syst.	2015	DBLP DOI BibTeX RDF
19	Rémy Chrétien, Véronique Cortier, Stéphanie Delaune	Decidability of Trace Equivalence for Protocols with Nonces.	CSF	2015	DBLP DOI BibTeX RDF
19	Alexander Kurz 0001, Stefan Milius, Dirk Pattinson, Lutz Schröder	Simplified Coalgebraic Trace Equivalence.	Software, Services, and Systems	2015	DBLP DOI BibTeX RDF
19	Rémy Chrétien, Véronique Cortier, Stéphanie Delaune	Checking Trace Equivalence: How to Get Rid of Nonces?	ESORICS (2)	2015	DBLP DOI BibTeX RDF
19	David Baelde, Stéphanie Delaune, Lucca Hirschi	A reduced semantics for deciding trace equivalence using constraint systems.	CoRR	2014	DBLP BibTeX RDF
19	Alexander Kurz 0001, Stefan Milius, Dirk Pattinson, Lutz Schröder	Simplified Coalgebraic Trace Equivalence.	CoRR	2014	DBLP BibTeX RDF
19	David Baelde, Stéphanie Delaune, Lucca Hirschi	A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems.	POST	2014	DBLP DOI BibTeX RDF
19	Vincent Cheval	APTE: An Algorithm for Proving Trace Equivalence.	TACAS	2014	DBLP DOI BibTeX RDF
19	Hao Yang, Anping He, Zhiwei Zhang, Shihan Yang, Yang Liu	Approximate Completed Trace Equivalence of Linear Algebra Transition Systems.	BIC-TA	2013	DBLP DOI BibTeX RDF
19	Myrto Arapinis, Sergiu Bursuc, Mark Dermot Ryan	Reduction of Equational Theories for Verification of Trace Equivalence: Re-encryption, Associativity and Commutativity.	POST	2012	DBLP DOI BibTeX RDF
19	Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune	Trace equivalence decision: negative tests and non-determinism.	CCS	2011	DBLP DOI BibTeX RDF
19	Ala' Hawash, Anton Deik, Bilal Farraj, Mustafa Jarrar	Towards query optimization for the data web: disk-based algorithms: trace equivalence and bisimilarity.	ISWSA	2010	DBLP DOI BibTeX RDF
19	Luca Aceto, Silvio Capobianco	On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt.	Bull. EATCS	2008	DBLP BibTeX RDF
19	Paul Blain Levy	Infinite trace equivalence.	Ann. Pure Appl. Log.	2008	DBLP DOI BibTeX RDF
19	Paul Blain Levy	Infinite Trace Equivalence.	MFPS	2005	DBLP DOI BibTeX RDF
19	Yoshinobu Kawabe, Ken Mano	Verifying Trace Equivalence of a Shared-Memory-Style Communication System.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2005	DBLP DOI BibTeX RDF
19	Paul Blain Levy	Infinite trace equivalence.	GALOP@ETAPS	2005	DBLP BibTeX RDF
19	Bard Bloom	When is Partial Trace Equivalence Adequate?	Formal Aspects Comput.	1994	DBLP DOI BibTeX RDF
19	Guang-Ping Qin, Jin-Zhao Wu	Action Refinement for Real-Time Concurrent Processes with Urgency.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	timed event, real-time process algebra, structure, action refinement, urgency
19	Wan J. Fokkink, Sumit Nain	On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds.	FoSSaCS	2004	DBLP DOI BibTeX RDF
19	Mila E. Majster-Cederbaum, Jinzhao Wu	Adding Action Refinement to Stochastic True Concurrency Models.	ICFEM	2003	DBLP DOI BibTeX RDF
19	Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu	Action Refinement for Probabilistic Processes with True Concurrency Models.	PAPM-PROBMIV	2002	DBLP DOI BibTeX RDF
19	Yoram Hirshfeld	Petri Nets and the Equivalence Problem.	CSL	1993	DBLP DOI BibTeX RDF
19	Luca Aceto	Full Abstraction for Series-Parallel Pomsets.	TAPSOFT, Vol.1	1991	DBLP DOI BibTeX RDF
19	Naoki Kobayashi 0001, Takashi Suto	Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus.	ICALP	2007	DBLP DOI BibTeX RDF
19	Marco Bernardo 0001	A Survey of Markovian Behavioral Equivalences.	SFM	2007	DBLP DOI BibTeX RDF
19	Henri Hansen, Antti Valmari	Operational Determinism and Fast Algorithms.	CONCUR	2006	DBLP DOI BibTeX RDF
19	François Laroussinie, Philippe Schnoebelen	The State Explosion Problem from Trace to Bisimulation Equivalence.	FoSSaCS	2000	DBLP DOI BibTeX RDF
14	Filippo Bonchi, Barbara König 0001, Ugo Montanari	Saturated Semantics for Reactive Systems.	LICS	2006	DBLP DOI BibTeX RDF
14	Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin	A classification of symbolic transition systems.	ACM Trans. Comput. Log.	2005	DBLP DOI BibTeX RDF	infinite-state model checking, state equivalences, Model checking, temporal logics, hybrid automata, symbolic algorithms
14	Rocco De Nicola, Daniele Gorla, Rosario Pugliese	Basic Observables for a Calculus for Global Computing.	ICALP	2005	DBLP DOI BibTeX RDF
14	Alan Jeffrey, Julian Rathke	Java Jr: Fully Abstract Trace Semantics for a Core Java Language.	ESOP	2005	DBLP DOI BibTeX RDF
14	Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi	Secure Contexts for Confidential Data.	CSFW	2003	DBLP DOI BibTeX RDF
14	Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir	2-Nested Simulation Is Not Finitely Equationally Axiomatizable.	STACS	2001	DBLP DOI BibTeX RDF
14	Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar	Symbolic Algorithms for Infinite-State Games.	CONCUR	2001	DBLP DOI BibTeX RDF
14	Thomas A. Henzinger, Rupak Majumdar	A Classification of Symbolic Transition Systems.	STACS	2000	DBLP DOI BibTeX RDF
14	Lalita Jategaonkar, Albert R. Meyer	Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report).	ICALP	1993	DBLP DOI BibTeX RDF
14	Ursula Goltz, Ruurd Kuiper 0001, Wojciech Penczek	Propositional Temporal Logics and Equivalences.	CONCUR	1992	DBLP DOI BibTeX RDF
14	Khaled El-Fakih, Nina Yevtushenko 0001	Progressive Solutions to FSM Equations.	CIAA	2008	DBLP DOI BibTeX RDF
14	Dimitrios Vardoulakis, Mitchell Wand	A Compositional Trace Semantics for Orc.	COORDINATION	2008	DBLP DOI BibTeX RDF
14	Birgit Schieder	Pointer Theory and Weakest Preconditions without Addresses and Heap.	MPC	2004	DBLP DOI BibTeX RDF
14	Howard Foster, Sebastián Uchitel, Jeff Magee, Jeff Kramer	Model-based Verification of Web Service Compositions.	ASE	2003	DBLP DOI BibTeX RDF
9	Alessio Lomuscio, Wojciech Penczek, Hongyang Qu 0001	Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic.	MoChArt	2008	DBLP DOI BibTeX RDF
9	Lin Song, Yuxin Deng, Xiaojuan Cai	Towards Automatic Measurement of Probabilistic Processes.	QSIC	2007	DBLP DOI BibTeX RDF
9	Jason Baumgartner, Hari Mony	Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies.	CHARME	2005	DBLP DOI BibTeX RDF
9	Richard Raimi, Ramin Hojati, Kedar S. Namjoshi	Environment modeling and language universality.	ACM Trans. Design Autom. Electr. Syst.	2000	DBLP DOI BibTeX RDF	language universality, model checking, abstraction, environment modeling
9	Thomas A. Henzinger, Rupak Majumdar	Symbolic Model Checking for Rectangular Hybrid Systems.	TACAS	2000	DBLP DOI BibTeX RDF
9	Thomas A. Henzinger, Benjamin Horowitz, Rupak Majumdar	Rectangular Hybrid Games.	CONCUR	1999	DBLP DOI BibTeX RDF
9	Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Alexandre Yakovlev	A region-based theory for state assignment in speed-independent circuits.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
9	Pawel Paczkowski	Ignoring Nonessential Interleavings in Assertional Reasoning on Concurrent Programs.	MFCS	1993	DBLP DOI BibTeX RDF
9	Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklos Santha	Parallel Complexity in the Design and Analysis on Conurrent Systems.	PARLE (1)	1991	DBLP DOI BibTeX RDF	partially commutative monoids, PRAM algorithms, Petri nets, CCS, boolean circuits, P-completeness