The following pages link to (Q4385542):
Displaying 50 items.
- A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases (Q266861) (← links)
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- A formalization of programs in first-order logic with a discrete linear order (Q274400) (← links)
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Stutter-invariant temporal properties are expressible without the next-time operator (Q290250) (← links)
- Checking EMTLK properties of timed interpreted systems via bounded model checking (Q310082) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Property transformation under specification change (Q352027) (← links)
- Embedding of biological regulatory networks and property preservation (Q359895) (← links)
- Program equilibrium -- a program reasoning approach (Q361805) (← links)
- A formal model of emotion triggers: an approach for BDI agents (Q375310) (← links)
- Model checking quantum Markov chains (Q394340) (← links)
- Combined model checking for temporal, probabilistic, and real-time logics (Q407511) (← links)
- A structural/temporal query language for business processes (Q414923) (← links)
- The sweep-line state space exploration method (Q418783) (← links)
- Symbolic execution of Reo circuits using constraint automata (Q433344) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Complexity of synthesis of composite service with correctness guarantee (Q439758) (← links)
- Reliability-aware automatic composition approach for web services (Q439793) (← links)
- On the analysis of compensation correctness (Q444367) (← links)
- Agent deliberation in an executable temporal framework (Q456706) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Runtime verification of embedded real-time systems (Q479806) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Partial-order Boolean games: informational independence in a logic-based model of strategic interaction (Q516248) (← links)
- Prior and temporal sequences for natural language (Q516415) (← links)
- Refining autonomous agents with declarative beliefs and desires (Q520236) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity (Q526730) (← links)
- Symbolic trajectory evaluation for word-level verification: theory and implementation (Q526779) (← links)
- Constructing situations and time (Q543532) (← links)
- Deontic epistemic stit logic distinguishing modes of mens rea (Q545173) (← links)
- Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures (Q548479) (← links)
- Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
- Safe reasoning with logic LTS (Q549200) (← links)
- Application of static analyses for state-space reduction to the microcontroller binary code (Q617924) (← links)
- Verifying the consistency of web-based technical documentations (Q617987) (← links)
- Providing RIA user interfaces with accessibility properties (Q617994) (← links)
- Updating action domain descriptions (Q622109) (← links)
- Completeness for flat modal fixpoint logics (Q638475) (← links)
- Synchronized linear-time temporal logic (Q647400) (← links)
- On the computational complexity of behavioral description-based web service composition (Q650907) (← links)
- Making a start with the stit logic analysis of intentional action (Q652741) (← links)
- Where logic and agents meet (Q657584) (← links)
- The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- About the expressive power of CTL combinators (Q672975) (← links)
- Translations between modal logics of reactive systems (Q674003) (← links)
- Conversation protocols: a formalism for specification and verification of reactive electronic services (Q703491) (← links)
- Encapsulating deontic and branching time specifications (Q714879) (← links)
