Ontology type: schema:Chapter
2017-05-05
AUTHORSAndreas E. Dalsgaard , Søren Enevoldsen , Peter Fogh , Lasse S. Jensen , Tobias S. Jepsen , Isabella Kaufmann , Kim G. Larsen , Søren M. Nielsen , Mads Chr. Olesen , Samuel Pastva , Jiří Srba
ABSTRACTEquivalence and model checking problems can be encoded into computing fixed points on dependency graphs. Dependency graphs represent causal dependencies among the nodes of the graph by means of hyper-edges. We suggest to extend the model of dependency graphs with so-called negation edges in order to increase their applicability. The graphs (as well as the verification problems) suffer from the state space explosion problem. To combat this issue, we design an on-the-fly algorithm for efficiently computing fixed points on extended dependency graphs. Our algorithm supplements previous approaches with the possibility to back-propagate, in certain scenarios, the domain value 0, in addition to the standard back-propagation of the value 1. Finally, we design a distributed version of the algorithm, implement it in an open-source tool, and demonstrate the efficiency of our general approach on the benchmark of Petri net models and CTL queries from the Model Checking Contest 2016. More... »
PAGES139-158
Application and Theory of Petri Nets and Concurrency
ISBN
978-3-319-57860-6
978-3-319-57861-3
http://scigraph.springernature.com/pub.10.1007/978-3-319-57861-3_10
DOIhttp://dx.doi.org/10.1007/978-3-319-57861-3_10
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1085127576
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Computation Theory and Mathematics",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Dalsgaard",
"givenName": "Andreas E.",
"id": "sg:person.014315474147.82",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014315474147.82"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Enevoldsen",
"givenName": "S\u00f8ren",
"id": "sg:person.014121174364.65",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014121174364.65"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Fogh",
"givenName": "Peter",
"id": "sg:person.015326142043.06",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015326142043.06"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Jensen",
"givenName": "Lasse S.",
"id": "sg:person.015514135364.54",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015514135364.54"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Jepsen",
"givenName": "Tobias S.",
"id": "sg:person.016311515764.16",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016311515764.16"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Kaufmann",
"givenName": "Isabella",
"id": "sg:person.07606444564.86",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07606444564.86"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Larsen",
"givenName": "Kim G.",
"id": "sg:person.012135303667.82",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012135303667.82"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Nielsen",
"givenName": "S\u00f8ren M.",
"id": "sg:person.011201405564.40",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011201405564.40"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Olesen",
"givenName": "Mads Chr.",
"id": "sg:person.012740662302.62",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012740662302.62"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Faculty of Informatics, Masaryk University, Brno, Czech Republic",
"id": "http://www.grid.ac/institutes/grid.10267.32",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"Faculty of Informatics, Masaryk University, Brno, Czech Republic"
],
"type": "Organization"
},
"familyName": "Pastva",
"givenName": "Samuel",
"id": "sg:person.016130263073.10",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016130263073.10"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Aalborg University, Aalborg East, Denmark",
"id": "http://www.grid.ac/institutes/grid.5117.2",
"name": [
"Department of Computer Science, Aalborg University, Aalborg East, Denmark"
],
"type": "Organization"
},
"familyName": "Srba",
"givenName": "Ji\u0159\u00ed",
"id": "sg:person.012316540623.98",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012316540623.98"
],
"type": "Person"
}
],
"datePublished": "2017-05-05",
"datePublishedReg": "2017-05-05",
"description": "Equivalence and model checking problems can be encoded into computing fixed points on dependency graphs. Dependency graphs represent causal dependencies among the nodes of the graph by means of hyper-edges. We suggest to extend the model of dependency graphs with so-called negation edges in order to increase their applicability. The graphs (as well as the verification problems) suffer from the state space explosion problem. To combat this issue, we design an on-the-fly algorithm for efficiently computing fixed points on extended dependency graphs. Our algorithm supplements previous approaches with the possibility to back-propagate, in certain scenarios, the domain value 0, in addition to the standard back-propagation of the value 1. Finally, we design a distributed version of the algorithm, implement it in an open-source tool, and demonstrate the efficiency of our general approach on the benchmark of Petri net models and CTL queries from the Model Checking Contest 2016.",
"editor": [
{
"familyName": "van der Aalst",
"givenName": "Wil",
"type": "Person"
},
{
"familyName": "Best",
"givenName": "Eike",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-319-57861-3_10",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-319-57860-6",
"978-3-319-57861-3"
],
"name": "Application and Theory of Petri Nets and Concurrency",
"type": "Book"
},
"keywords": [
"dependency graph",
"open source tools",
"state space explosion problem",
"fixed-point computation",
"model checking problem",
"space explosion problem",
"Petri net model",
"Extended Dependency Graphs",
"CTL queries",
"checking problem",
"explosion problem",
"causal dependencies",
"fly algorithm",
"net model",
"previous approaches",
"algorithm",
"graph",
"certain scenarios",
"queries",
"general approach",
"computation",
"nodes",
"benchmarks",
"scenarios",
"model",
"tool",
"values 0",
"dependency",
"issues",
"version",
"applicability",
"point",
"efficiency",
"edge",
"order",
"value 1",
"means",
"equivalence",
"possibility",
"addition",
"problem",
"approach"
],
"name": "Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation",
"pagination": "139-158",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1085127576"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-319-57861-3_10"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-319-57861-3_10",
"https://app.dimensions.ai/details/publication/pub.1085127576"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-08-04T17:14",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_135.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-319-57861-3_10"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-57861-3_10'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-57861-3_10'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-57861-3_10'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-57861-3_10'
This table displays all metadata directly associated to this object as RDF triples.
180 TRIPLES
22 PREDICATES
66 URIs
59 LITERALS
7 BLANK NODES