A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories

DOI10.1007/978-3-319-51963-0_5zbMath1433.68213OpenAlexW2343479187MaRDI QIDQ2971124

Uli Fahrenberg, Axel Legay

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_5

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items

Computing branching distances with quantitative games, A linear-time-branching-time spectrum for behavioral specification theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• General quantitative specification theories with modal transition systems
• Nested semantics over finite trees are equationally hard
• Calculi for synchrony and asynchrony
• A context dependent equivalence between processes
• Failures semantics and deadlocking of modular Petri nets
• Bisimulation through probabilistic testing
• Structured operational semantics and bisimulation as a congruence
• Modal event-clock specifications for timed component-based design
• Weighted modal transition systems
• ACTL for modal interface automata
• The quantitative linear-time-branching-time spectrum
• A Modal Interface Theory for Component-based Design
• Extending modal transition systems with structured labels
• Ensuring Reachability by Design
• Modal Transition Systems: Composition and LTL Model Checking
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Communicating sequential processes