A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
A logic for the description of nondeterministic programs and their properties
Information and Control
Finite conjunctive nondeterminism
Concurrency and nets: advances in Petri nets
Ready-trace semantics for concrete process algebra with the priority operator
The Computer Journal
A refinement calculus for specifications in Hennessy-Milner logic with recursion
Formal Aspects of Computing
Bisimulation through probabilistic testing
Information and Computation
Graphical versus logical specifications
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Selected papers of the 3rd workshop on Concurrency and compositionality
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Journal of the ACM (JACM)
Communication and concurrency
Specifying the mode logic of a flight guidance system in CoRE and SCR
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Handbook of Process Algebra
Disjunction of LOTOS Specifications
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
A Constraint Oriented Proof Methodology Based on Modal Transition Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Possible Worlds for Process Algebras
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A logig for the description of behaviours and properties of concurrent systems
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
A compositional specification theory for component behaviours
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Ready simulation for concurrency: it's logical!
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 5.23 |
A key problem in mixing operational (e.g. process-algebraic) and declarative (e.g. logical) styles of specification is how to deal with inconsistencies arising when composing processes under conjunction. This article introduces a conjunction operator on labelled transition systems capturing the basic intuition of 'a and b = false', and considers a naive preorder that demands that an inconsistent specification can only be refined by an inconsistent implementation. The main body of the article is concerned with characterizing the largest precongruence contained in the naive preorder. This characterization will be based on what we call ready-tree semantics, which is a variant of path-based possible-worlds semantics. We prove that the induced ready-tree preorder is compositional and fully abstract, and that the conjunction operator indeed reflects conjunction. The article's results provide a foundation for, and an important step towards a unified framework that allows one to freely mix operators from process algebras and linear-time temporal logics.