Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Pnueli (1985)
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
B. Bloom, S. Istrail, A. Meyer (1995)
Bisimulation can't be tracedJ. ACM, 42
(1979)
Full abstraction for a simple programming language
T. Bolognesi, F. Lucidi, S. Trigila (1990)
From timed Petri nets to timed LOTOS
A. Gelder, K. Ross, J. Schlipf (1988)
Unfounded sets and well-founded semantics for general logic programs
J. Groote (1993)
Transition System Specifications with Negative PremisesTheor. Comput. Sci., 118
R. Glabbeek (1993)
Full Abstraction in Structural Operational Semantics
(1990)
Algebraic Techniques for Concurrency and their Application
R. Glabbeek (1996)
The meaning of negative premises in transition system specifications IIJ. Log. Algebraic Methods Program., 60-61
L. Aceto, B. Bloom, F. Vaandrager (1992)
Turning SOS rules into equations[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science
R. Glabbeek (1990)
The Linear Time-Branching Time Spectrum (Extended Abstract)
P~Pos(Red"'-(P) )-bisimulation relation
PhilosophyUtrecht UniversityHeidelberglaan, Cs Utrecht (1995)
A Conservative Look at Term Deduction Systemswith Variable BindingWan FokkinkDepartment of
(1989)
Morgan-Kaufmann Publishers, Inc. (Los Altos, Calif.)
X. Nicollin, J. Richier, J. Sifakis, Jacques Voiron (1990)
ATP: an Algebra for Timed Processes
R. Glabbeek (1987)
Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra
L. Aceto (1994)
Deriving Complete Inference Systems for a Class of GSOS Languages Generation Regular Behaviours
R. Cleaveland, M. Hennessy (1988)
Priorities in process algebras[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
J. Baeten, C. Verhoef (1993)
A Congruence Theorem for Structured Operational Semantics with Predicates
C. Koomen (1991)
Calculus of Communicating Systems
M. Hennessy, Tim Regan (1990)
A Temporal Process Algebra
Teodor Przymusinski (1988)
On the Declarative Semantics of Deductive Databases and Logic Programs
Jcm Baeten, J. Bergstra (1987)
Processen en procesexpressies, 30
B. Bloom, S. Istrail, A. Meyer (1987)
Bisimulation can't be traced. Preliminary report
J. Lloyd (1987)
Foundations of logic programming; (2nd extended ed.)
J. Groote, F. Vaandrager (1992)
Structured Operational Semantics and Bisimulation as a CongruenceInf. Comput., 100
Teodor Przymusinski (1989)
Every logic program has a natural stratification and an iterated least fixed point model
R. Langerak (1989)
A Testing Theory for LOTOS using Deadlock Detection
D. Park (1981)
Concurrency and Automata on Infinite Sequences
R. Glabbeek (1993)
The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves
(1991)
RECEIVED NOVEMBER REVISED MARCH Journal of the ACM
(1990)
Partial order semantics of priority systems
W. Fokkink, R. Glabbeek (1996)
Ntyft/Ntyxt Rules Reduce to Ntree RulesInf. Comput., 126
R. Reiter (1987)
A Logic for Default ReasoningArtif. Intell., 13
H. Ichikawa, K. Yamanaka, J. Kato (1990)
Incremental specification in LOTOS
Baeten, Klop, Fundamenta Informaticae (1985)
Syntax and defining equations for an interrupt mechanism in process algebra, 8503
R. Glabbeek (1993)
The Linear Time - Branching Time Spectrum II
K. Apt, R. Bol (1994)
Logic Programming and Negation: A SurveyJ. Log. Program., 19/20
(1989)
North-Holland, Amsterdam, The Netherlands, pp. 395-408
W. Fokkink, C. Verhoef (1995)
A conservative look at term deduction systems with variable bindingLogic group preprint series, 140
P. Dembinski, J. Maluszynski (1985)
AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs
B. Bloom (1995)
Structural Operational Semantics for Weak BisimulationsTheor. Comput. Sci., 146
Weidong Chen, D. Warren (1993)
Query evaluation under the well-founded semantics
Douglas Howe (1996)
Proving Congruence of Bisimulation in Functional Programming LanguagesInf. Comput., 124
J. Lloyd (1984)
Foundations of Logic Programming
C. Verhoef (1994)
A General Conservative Extension Theorem in Process Algebra
(1989)
Specificatie en verificatie van communicatieprotocollen met procesalgebra
J. Baeten, W. Weijland (1990)
Process algebra, 18
L. Aceto, A. Ingólfsdóttir (1995)
CPO Models for a Class of GSOS Languages
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in order to be meaningful, that is, to unequivocally define a transition relation. We also provide powerful techniques for proving that a TSS satisfies this criterion, meanwhile constructing this transition relation. Both the criterion and the techniques originate from logic programming van Gelder et al. 1988; Gelfond and Lifschitz 1988 to which TSSs are close. In an appendix we provide an extensive comparison between them. As in Groote 1993, we show that the bisimulation relation induced by a TSS is a congruence, provided that it is in ntyft/ntyxt -format and can be proved meaningful using our techniques. We also considerably extend the conservativity theorems of Groote1993 and Groote and Vaandrager 1992. As a running example, we study the combined addition of priorities and abstraction to Basic Process Algebra (BPA). Under some reasonable conditions we show that this TSS is indeed meaningful, which could not be shown by other methods Bloom et al. 1995; Groote 1993. Finally, we provide a sound and complete axiomatization for this example.
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Sep 1, 1996
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.